CS212 : Design and Analysis of Algorithms
Introduction
Asymptotic Notations
Recurrence Relations
Insertion Sort
Merge Sort
Quick Sort
Subpart
Subpart 2
Sorting Lower Bound
Bucket Sort
Randomised k^th order
Median of Medians
Writeup
Binary Search Tree
Write Up
Red Black Trees
Clever Way
Kruskal Algorithm
Union-Find
Prims Algorithm
Implementation
Single Source Shortest Path
Dijkstra’s Algorithm
Dynamic Programming
Flow Networks
Ford-Fulkerson
Application of Flow network.
Amortized Analysis
Heap Sort
KC and Assignment
Computational Complexity
End Sem Exam
