Reference and Selective Reading
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/reference/index.md - App:
foundations - Semester:
semester-02-algorithms - Module:
module-02-sorting-searching-structures - Unit kind:
reference - Curation level:
generated_default
Learning objectives
- Use Reference and Selective Reading as targeted reinforcement instead of treating the source books as a separate reading track.
- Choose the smallest source route that resolves the current blocker and then return to the learner path.
- Extract one clarification or example from
algorithms-sedgewick,competitive-programming,grokking-algorithms,introduction-to-algorithms-clrs,the-algorithm-design-manualthat makes the current module easier to execute.
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-12-elementary-sorting-methods via
Sedgewick: Elementary sorting - /books/algorithms-sedgewick/chapter-13-quicksort via
Sedgewick: Quicksort - /books/algorithms-sedgewick/chapter-14-radix-sorting via
Sedgewick: Radix sorting - /books/algorithms-sedgewick/chapter-15-priority-queues via
Sedgewick: Priority Queues - /books/algorithms-sedgewick/chapter-16-selection-and-merging via
Sedgewick: Selection and Merging (extended) - /books/algorithms-sedgewick/chapter-17-elementary-searching-methods via
Sedgewick: Elementary searching methods - /books/algorithms-sedgewick/chapter-19-hashing via
Sedgewick: Hashing - /books/algorithms-sedgewick/chapter-21-external-searching via
Sedgewick: External Searching
Competitive Programming
- /books/competitive-programming/chapter-02-overview-and-motivation via
Competitive Programming: Non-linear DS with built-in libraries - /books/competitive-programming/chapter-03-overview-and-motivation via
Competitive Programming: 3.3.1 Interesting Usages of Binary Search
Grokking Algorithms
- /books/grokking-algorithms via
Grokking Algorithms: Binary Search - /books/grokking-algorithms/chapter-05-hash-tables via
Grokking Algorithms: Collisions, Performance, Load Factor,Grokking Algorithms: Hash Tables
Introduction To Algorithms Clrs
- /books/introduction-to-algorithms-clrs/chapter-02-insertion-sort via
CLRS 2.3,CLRS: 2.1 Insertion Sort,CLRS: 2.1 Insertion Sort (continued),CLRS: 2.3 Designing Algorithms (mergesort) - /books/introduction-to-algorithms-clrs/chapter-06-heaps via
CLRS 6.1,CLRS 6.5,CLRS: 6.1 Heaps,CLRS: 6.2 Maintaining the Heap Property,CLRS: 6.3 Building a Heap; Heapsort,CLRS: 6.5 Priority Queues - /books/introduction-to-algorithms-clrs/chapter-07-description-of-quicksort via
CLRS 7.3,CLRS: 7.1 Description of Quicksort,CLRS: 7.2 Performance of Quicksort,CLRS: 7.3 Randomized Quicksort,CLRS: 7.4 Analysis of Quicksort - /books/introduction-to-algorithms-clrs/chapter-08-lower-bounds-for-sorting via
CLRS 8.1,CLRS: 8.1 Lower Bounds for Sorting,CLRS: 8.2 Counting Sort,CLRS: 8.3 Radix Sort,CLRS: 8.3 Radix Sort (continued),CLRS: 8.4 Bucket Sort - /books/introduction-to-algorithms-clrs/chapter-09-minimum-and-maximum via
CLRS 9.2,CLRS: 9.1 Minimum and Maximum,CLRS: 9.2 Selection in Expected Linear Time,CLRS: 9.3 Selection in Worst-Case Linear Time - /books/introduction-to-algorithms-clrs/chapter-10-simple-array-based-data-structures-arrays-matrices-stacks-que via
CLRS: 10.1 Simple Array-Based Data Structures,CLRS: 10.2 Linked Lists - /books/introduction-to-algorithms-clrs/chapter-11-direct-address-tables via
CLRS 11.2,CLRS 11.4,CLRS: 11.1 Direct-Address Tables,CLRS: 11.2 Hash Tables,CLRS: 11.2 Hash Tables (continued),CLRS: 11.3 Hash Functions,CLRS: 11.3 Hash Functions (extended),CLRS: 11.4 Open Addressing,CLRS: 11.5 Practical Considerations
The Algorithm Design Manual
- /books/the-algorithm-design-manual/chapter-03-contiguous-vs-linked-data-structures via
Skiena: 3.1 Contiguous vs Linked Data Structures,Skiena: 3.5 Priority Queues,Skiena: 3.7 Hashing and Strings,Skiena: 3.7.2 Efficient String Matching via Hashing - /books/the-algorithm-design-manual/chapter-04-applications-of-sorting via
Skiena 4.9,Skiena: 4.1 Applications of Sorting,Skiena: 4.10 Divide and Conquer,Skiena: 4.2 Pragmatics of Sorting,Skiena: 4.3 Heapsort,Skiena: 4.3.2 Constructing Heaps,Skiena: 4.5 Mergesort,Skiena: 4.6 Quicksort,Skiena: 4.7 Distribution Sort,Skiena: 4.9 Binary Search and Related Algorithms - /books/the-algorithm-design-manual/unsorted-sorted via
Skiena: Unsorted vs Sorted
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 Reference and Selective Reading, and treat outside material as supporting enrichment only.