DSA Pre-Mid
Topics
1. All General
Algorithms related to search and sort.
2. Arrays.
General arrays and traversal algorithms.
a. Polynomial
algorithms, general matrices.
b. Dynamic
arrays, dynamic declaration, dynamic growth and shrinking.
c. Inorder
insertion. Deletion, inorder deletion.
d. 2D array
search, traversal. Complex 2D/3D loops for any purpose.
3. Algorithm
techniques:
Brute Force vs Divide & Conquer.
Brute Force vs Divide & Conquer.
4. Time cost.
Loop cost, nested loop, initialization and boundary checking cost. Exact cost
verses order of complexity.
5. Stack:
using Array and Linked list. Stack ordering, ToH problem, in-order insertion in stack using a temporary stack, stack search and delete using temporary stack, Sorting using stack.
using Array and Linked list. Stack ordering, ToH problem, in-order insertion in stack using a temporary stack, stack search and delete using temporary stack, Sorting using stack.
![Twitter](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhKSFB-pMI-frl9_8jTljPyUIP8v6jUJwaaglyTN-XGe-aHtBaJw-kKuocdmZQ3T0fJh36hze_-0YT_iZwpoPVM_n9QNejfgRPJoIePAVUhp8g2wLA65pRG7Sk4BsxctjeiRYGO55xoNOjT/s0/twitter.png" border=0" border=0 "Twitter")
![Google Plus](https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgRzKDEsIvHEM-eNVzR1HCl5vbIc-buFZq9gtmuXqz3kEia6VeAVKNGsvQAvEpyCl2IOaSnKIwby_7hziifKY1gWSFldnFKUHU3q4HE2vVHOkL47qfl4eQRcu-Pl0NBFhBlBtAAMS2fQxoB/s0/gplus.png" border=0" border=0 "Google Plus")
