Fundamental Algorithms:Design and Analysis


Lecture 1 - Insertion Sort and Asymptotic Analysis


Lecture 2 - Solving Recurrences


Lecture 3 - Divide and Conquer Paradigm


Lecture 4 - Quick Sort


Lecture 5 - Heap Sort


Lecture 6 - Decision Tree


Lecture 7 - Linear Time Sorting


Lecture 8 - Order Statistics


Lecture 9 - Hashing


Lecture 10 - Universal Hashing, BST Sort


Lecture 11 - Red-Black Tree


Lecture 12 - Augmenting Data Structure


Lecture 13 - Computational Geometry


Lecture 14 - Van Emde Boas Data Structure


Lecture 15 - Dynamic Programming


Lecture 16 - Graph Algorithm


Lecture 17 - BFS and DFS


Lecture 18 - Dijkstra


Lecture 19 - Bellman Ford


Lecture 20 - Floyd Marshall