PHASE 07
๐ช Recursion, Sorting & Searching
Break problems into smaller copies of themselves, explore every possibility with backtracking, sort in O(n log n), and search in O(log n) โ including binary search on the answer.
โฑ๏ธ ~3 hours of lessons
๐ 4 lessons
โ๏ธ 7 exercises Medium
โถ Start this phase
๐ฏ In this phase you willโฆ
- Write recursive solutions with clear base cases
- Generate subsets and permutations with backtracking
- Explain merge sort and quick sort
- Apply binary search, including on answers
๐บ Lessons in this playlist
01
Thinking Recursively
02
Backtracking
03
Sorting Algorithms
04
Binary Search (and Searching the Answer)
๐ Phase test
Concept questions, pseudocode writing, tracing and debugging โ check youโre ready for the next phase.
๐ก Concept check
Which sort guarantees O(n log n) even in the worst case?
