Module P-5
Algorithms and Complexity
How to measure what an algorithm costs and how to design one that costs less: growth rates, recursion, sorting and searching, divide and conquer, greedy choices, dynamic programming, and the standard results on graphs.
6 topics ~80 h estimated learning time
Comes after—
Unlocks—
Sign in to keep your progress.
Ready to start
- P-5.1 Measuring Cost, and What Big-O Hides
Core · 12 h
- P-5.2 Recursion, and Trusting It
Core · 12 h
- P-5.3 Sorting
Core · 14 h
- P-5.4 Searching and Binary Search
Core · 10 h
- P-5.5 Greedy Choices and Dynamic Programming
Advanced · 16 h
- P-5.6 Graph Algorithms
Advanced · 16 h