This section is aligned to the algorithms-focused chapters from Data Structures and Algorithms using Python by Rance Necaise.
Book chapter coverage in this section
| Book chapter | Topic | Our page(s) | Coverage |
|---|---|---|---|
| Chapter 5 | Algorithm Analysis | Big-O and Analysis | Covered |
| Chapter 6 | Searching and Sorting | Searching, Sorting | Covered |
| Chapter 12 | Recursion | Dynamic Programming | Partial |
| Chapter 13 | Advanced Sorting | Sorting | Partial |
Recommended order
- Big-O and Analysis
- Searching
- Sorting
- Recursion drills (temporary coverage through Dynamic Programming)
- Advanced sorting variants and tradeoffs
Additional algorithm topics in this curriculum
These are outside the chapter names above, but remain core parts of our path:
TOC source: datastructures.necaise.org/TableOfContents. I reviewed all listed chapters (1-15), with detailed subsection entries currently published for chapters 1-9.