Midterm Topics
| 1 | Introduction | |||||
| 2 | Time and computational complexities of algorithms, Asymptotic notations | |||||
| 3 | Sorting algorithms (Merge, Heap,Quick,Insertion,Bubble,Selection, Counting Sort) | |||||
| 4 | Searching algorithms(Linear, Binary) | |||||
| 5 | Divide and Conquer (Inversion Count, MSSC, will be updated= | |||||
| 6 | Recurrence relations | |||||
| 7. | Graph (BFS DFS ) | |||||