Syllabus - Design and Analysis of Algorithm

 Syllabus

S. No.	Topic	Contents
1.	Introduction to Algorithms	History, Definition, Need of algorithms, Algorithm Vs Program, Good Algorithm, Analysis of algorithms, Complexities of the algorithm.
2.	Growth of function	Asymptotic Analysis, Find Time Complexity, Recurrence, Question on recurrence, Substitution Method, Iterative Method, Recurrence Tree Method, Master's Method, Extended Master's Method
3.	Sorting	Types of Sorting, Bubble Sort, Modified Bubble Sort, Selection Sort, Tim Sort, Insertion Sort, Shell Sort, Quicksort, Randomized Quicksort, Merge Sort, Sorting in Linear time - Radix Sort, Counting Sort, Bucket Sort. Tree Sort, Heap Sort, Cheat Sheet of Sorting Algorithms.
4.	Searching	Linear Search, Binary Search, Miscellaneous Problem.