Algorithms

Study of algorithm analysis, sorting, searching, and design techniques.

📝 Topics

• Asymptotic Analysis: Big-O, Master Theorem, and growth rates.
• Sorting: Stability, in-place, and comparison-based sorts.
• Searching: Binary search and matrix search.
• Hashing: Collision resolution and load factors.
• Graph Algorithms: MST (Prim/Kruskal) and Shortest Paths (Dijkstra/Bellman-Ford).
• DP and Greedy: Knapsack, Huffman coding, and matrix chains.
• Divide and Conquer: Median finding and recurrences.

---

Back to Core CS