The Algorithm Design Manual
This book lives in the reference app as generated chapter pages. The learner path should still start in the curriculum apps.
Semester target
semester-02-algorithms
Publish mode
chapter
Generated chapters
| Chapter | Chunk Files | Approx. Words | Route |
|---|---|---|---|
| Chapter 1: Robot Tour Optimization | 8 | 8775 | Overview |
| Chapter 2: The Ram Model Of Computation | 12 | 11574 | Overview |
| Chapter 3: Contiguous Vs Linked Data Structures | 10 | 10961 | Overview |
| Chapter 4: Applications Of Sorting | 14 | 12155 | Overview |
| Chapter 5: Graph Traversal | 14 | 11523 | Overview |
| Chapter 6: Minimum Spanning Trees | 12 | 11810 | Overview |
| Chapter 7: Backtracking | 13 | 12178 | Overview |
| Chapter 8: Fibonacci Numbers By Recursion | 16 | 16512 | Overview |
| Chapter 9: Intractable Problems And Approximation | 13 | 12211 | Overview |
| Chapter 10: How To Design Algorithms | 1 | 592 | Open |
| Chapter 12: Data Structures | 8 | 8771 | Overview |
| Chapter 13: Numerical Problems | 13 | 14243 | Overview |
| Chapter 14: Combinatorial Problems | 12 | 13304 | Overview |
| Chapter 15: Graph Problems Polynomial Time | 15 | 15659 | Overview |
| Chapter Notes 4 11 Exercises | 1 | 1584 | Open |
| Chapter Notes Algorithm Design | 1 | 1259 | Open |
| Chapter Notes Minimum Spanning Trees | 1 | 1321 | Open |
| Unsorted Sorted | 1 | 1032 | Open |