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-02-sorting-searching-structures/resources.md - App:
foundations - Semester:
semester-02-algorithms - Module:
module-02-sorting-searching-structures - 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
algorithms-sedgewickcompetitive-programminggrokking-algorithmsintroduction-to-algorithms-clrsthe-algorithm-design-manual
Source routes
Algorithms Sedgewick
- /books/algorithms-sedgewick/chapter-07-random-numbers via
Sedgewick: Elementary sorting exercises,Sedgewick: Hashing exercises,Sedgewick: Priority queue exercises,Sedgewick: Quicksort exercises - /books/algorithms-sedgewick/chapter-13-quicksort via
Sedgewick: Quicksort - /books/algorithms-sedgewick/chapter-15-priority-queues via
Sedgewick: Priority Queues - /books/algorithms-sedgewick/chapter-21-external-searching via
Sedgewick: External Searching
Competitive Programming
- /books/competitive-programming/chapter-01-competitive-programming via
Competitive Programming 2.3,Competitive Programming 3.3.1 - /books/competitive-programming/chapter-02-overview-and-motivation via
Competitive Programming: Chapter 2 exercises
Grokking Algorithms
- /books/grokking-algorithms via
Grokking: Binary Search,Grokking: Collisions and Load Factor - /books/grokking-algorithms/chapter-05-hash-tables via
Grokking: Hash Tables
Introduction To Algorithms Clrs
- /books/introduction-to-algorithms-clrs/chapter-02-insertion-sort via
CLRS 2.1,CLRS 2.3 - /books/introduction-to-algorithms-clrs/chapter-06-heaps via
CLRS 6.1,CLRS 6.2,CLRS 6.3,CLRS 6.5 - /books/introduction-to-algorithms-clrs/chapter-07-description-of-quicksort via
CLRS 7.1,CLRS 7.2,CLRS 7.3 - /books/introduction-to-algorithms-clrs/chapter-08-lower-bounds-for-sorting via
CLRS 8.1,CLRS 8.2,CLRS 8.3,CLRS 8.4 - /books/introduction-to-algorithms-clrs/chapter-09-minimum-and-maximum via
CLRS 9.1,CLRS 9.2,CLRS 9.3 - /books/introduction-to-algorithms-clrs/chapter-10-simple-array-based-data-structures-arrays-matrices-stacks-que via
CLRS 10.1 - /books/introduction-to-algorithms-clrs/chapter-11-direct-address-tables via
CLRS 11.1,CLRS 11.2,CLRS 11.3,CLRS 11.4,CLRS 11.5
The Algorithm Design Manual
- /books/the-algorithm-design-manual/chapter-01-robot-tour-optimization via
Skiena: Chapter 3 Exercises,Skiena: Chapter 4 Exercises - /books/the-algorithm-design-manual/chapter-03-contiguous-vs-linked-data-structures via
Skiena 3.1,Skiena 3.5,Skiena 3.7 - /books/the-algorithm-design-manual/chapter-04-applications-of-sorting via
Skiena 4.1,Skiena 4.2,Skiena 4.3,Skiena 4.5,Skiena 4.7,Skiena 4.9
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.