Learning Resources
This generated surface maps a learner-facing curriculum unit to its canonical source routes.
Curriculum surface
- Open learner-facing unit
- Curriculum path:
content/curriculum/foundations/semester-02-algorithms/module-01-algorithm-analysis-design/resources.md - App:
foundations - Semester:
semester-02-algorithms - Module:
module-01-algorithm-analysis-design - Unit kind:
resource - Curation level:
generated_default
Learning objectives
- Pick a high-value support resource for Learning Resources without replacing the learner-facing module sequence.
- State why the chosen source belongs in the current learning problem before spending time on it.
- Return from the external resource with a concrete next action in the module.
Prerequisites
- The earlier concept pages and practice tasks in the current module.
Source books
competitive-programminggrokking-algorithmsintroduction-to-algorithms-clrsthe-algorithm-design-manual
Source routes
Competitive Programming
- /books/competitive-programming/chapter-01-competitive-programming via
Competitive Programming: Do algorithm analysis,Competitive Programming: Master the art of testing code,Competitive Programming: Solutions to chapter 1 exercises - /books/competitive-programming/chapter-03-overview-and-motivation via
Competitive Programming: Complete search,Competitive Programming: DP classical examples,Competitive Programming: DP illustration,Competitive Programming: Divide and conquer,Competitive Programming: Greedy,Competitive Programming: Recursive complete search
Grokking Algorithms
- /books/grokking-algorithms/chapter-09-dynamic-programming-part-1 via
Grokking: Dynamic programming (Part 1)
Introduction To Algorithms Clrs
- /books/introduction-to-algorithms-clrs/chapter-01-algorithms via
CLRS: Algorithms as a technology - /books/introduction-to-algorithms-clrs/chapter-02-insertion-sort via
CLRS: Analyzing algorithms,CLRS: Analyzing algorithms (insertion sort),CLRS: Designing algorithms,CLRS: Insertion sort - /books/introduction-to-algorithms-clrs/chapter-03-o-notation-theta-notation-and-omega-notation via
CLRS: Asymptotic notation, formal definitions - /books/introduction-to-algorithms-clrs/chapter-04-multiplying-square-matrices via
CLRS: Master method,CLRS: Recursion tree method,CLRS: Substitution method for recurrences - /books/introduction-to-algorithms-clrs/chapter-14-rod-cutting via
CLRS: Elements of dynamic programming,CLRS: Rod cutting - /books/introduction-to-algorithms-clrs/chapter-15-an-activity-selection-problem via
CLRS: Activity-selection problem,CLRS: Elements of the greedy strategy,CLRS: Huffman codes,CLRS: Offline caching (greedy vs DP) - /books/introduction-to-algorithms-clrs/chapter-16-aggregate-analysis via
CLRS: Aggregate analysis,CLRS: Dynamic tables,CLRS: The accounting method,CLRS: The potential method
The Algorithm Design Manual
- /books/the-algorithm-design-manual/chapter-01-robot-tour-optimization via
Skiena: Chapter 1 exercises,Skiena: Chapter 2 exercises,Skiena: Chapter 2 exercises (Part 2),Skiena: Chapter 8 exercises (Part 2),Skiena: Induction and recursion,Skiena: Modeling the problem,Skiena: Prove sum i = n(n+1)/2 by induction,Skiena: Recursive objects,Skiena: Selecting the right jobs - /books/the-algorithm-design-manual/chapter-02-the-ram-model-of-computation via
Skiena: Big-Oh notation,Skiena: Esoteric functions,Skiena: Growth rates and dominance relations,Skiena: Logarithms and summations,Skiena: Reasoning about efficiency,Skiena: The RAM model of computation - /books/the-algorithm-design-manual/chapter-04-applications-of-sorting via
Skiena: Chapter 4 exercises and chapter notes,Skiena: Divide and conquer,Skiena: Mergesort,Skiena: Solving divide-and-conquer recurrences,Skiena: War story - Give me a ticket on an airplane,Skiena: War story - Skiena for the defense - /books/the-algorithm-design-manual/chapter-07-backtracking via
Skiena: Backtracking,Skiena: Chapter 7 (backtracking) context,Skiena: Constructing all permutations,Skiena: Search pruning,Skiena: Sudoku - /books/the-algorithm-design-manual/chapter-08-fibonacci-numbers-by-recursion via
Skiena: Chapter 8 exercises (DP),Skiena: Fibonacci by caching,Skiena: Fibonacci by recursion,Skiena: Limitations of dynamic programming - /books/the-algorithm-design-manual/chapter-09-intractable-problems-and-approximation via
Skiena: War story - And then I failed,Skiena: War story - Hard against the clock - /books/the-algorithm-design-manual/chapter-notes-algorithm-design via
Skiena: Chapter notes on algorithm design
Supporting curriculum routes
No supporting curriculum routes linked yet.
External enrichment
No curated enrichment resources yet.
AI companion modes
- Explain simply
- Socratic tutor
- Quiz me
- Challenge my understanding
- Diagnose my confusion
- Generate extra practice
- Revision mode
- Connect forward / backward
Source-of-truth note
This teaching unit is learner-facing guidance assembled from multiple canonical book routes. Use the listed source books as the primary conceptual spine for Learning Resources, and treat outside material as supporting enrichment only.