Skip to content

Latest commit

 

History

History
 
 

04-algorithms-and-complexity

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

README.md

Phase 04 — Algorithms & Complexity Analysis

Master the canon — sorting, DP, graphs, strings, geometry, randomization — and the analysis tools that bound them.

Lessons: 30  ·  Estimated time: ~35 h 45 min Phase capstone artifact: An algorithms cookbook plus a benchmark harness.

Lessons

# Lesson Status Time
01 Analyzing Algorithms — Recurrences, Master Theorem in Action ✅ ~60 min
02 Sorting I — Insertion, Selection, Bubble, and Why They Lose ✅ ~45 min
03 Sorting II — Merge, Quick (and Quickselect) ✅ ~75 min
04 Sorting III — Heap, Intro, Tim ✅ ~75 min
05 Sorting IV — Linear-Time: Counting, Radix, Bucket ✅ ~60 min
06 Searching — Binary, Exponential, Ternary, Interpolation ✅ ~60 min
07 Divide & Conquer Patterns ✅ ~60 min
08 Dynamic Programming I — 1D, Memoization, Tabulation ✅ ~75 min
09 Dynamic Programming II — 2D and Beyond ✅ ~75 min
10 DP III — Bitmask, Digit, Tree, DP on DAGs ✅ ~90 min
11 Greedy Algorithms & Matroids ✅ ~75 min
12 Backtracking, Branch & Bound ✅ ~75 min
13 Graph Algorithms I — BFS, DFS, Topo, SCC ✅ ~75 min
14 Graph Algorithms II — Dijkstra, Bellman-Ford, A* ✅ ~75 min
15 Graph Algorithms III — Floyd-Warshall, Johnson, APSP ✅ ~60 min
16 Minimum Spanning Trees — Prim, Kruskal, Borůvka ✅ ~60 min
17 Network Flow — Ford-Fulkerson, Edmonds-Karp, Dinic ✅ ~90 min
18 Matching — Bipartite, Hopcroft-Karp, Hungarian ✅ ~75 min
19 String Matching — KMP, Z, Boyer-Moore ✅ ~75 min
20 Suffix Structures in Action — Aho-Corasick, LCP ✅ ~75 min
21 Hashing in Algorithms — Rabin-Karp, Rolling Hashes ✅ ~60 min
22 Computational Geometry I — Convex Hull, Sweep Line ✅ ~75 min
23 Computational Geometry II — kd-Tree, R-Tree, Range Query ✅ ~75 min
24 Randomized Algorithms — Las Vegas vs Monte Carlo ✅ ~60 min
25 Approximation Algorithms — Vertex Cover, TSP, Set Cover ✅ ~75 min
26 Online Algorithms & Competitive Analysis ✅ ~60 min
27 Streaming Algorithms — Frequency, Quantiles, HyperLogLog ✅ ~75 min
28 Parallel Algorithms — PRAM, Brent, Map-Reduce style ✅ ~75 min
29 Amortized Analysis Deep — Aggregate, Accounting, Potential ✅ ~60 min
30 Phase Capstone — Algorithm Cookbook + Benchmark Harness ✅ ~120 min

Legend: ✅ Complete  ·  🚧 In Progress  ·  ⬚ Planned

How this phase fits

See ../../ROADMAP.md for the full curriculum and prerequisites. See ../../LESSON_TEMPLATE.md for the shape every lesson follows.