Algorithms
Chapters
1. Asymptotic Analysis
Big-O, Big-Θ, Big-Ω, recurrence relations, master theorem.
2. Sorting Algorithms
Quick, merge, heap, counting, radix; time/space tradeoffs.
3. Graph Algorithms
BFS, DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, MST.
4. Greedy Algorithms
Activity selection, Huffman coding, fractional knapsack.
5. Dynamic Programming
LCS, 0/1 knapsack, matrix chain, edit distance.
6. Divide and Conquer
Binary search, merge sort, Strassen, closest pair.