| Binary Search and Its Invariant: Correctness as a Template | concept | 3 | Open |
| Collision Resolution: Chaining vs Open Addressing | concept | 3 | Open |
| Comparison Sorting Has an (\Omega(n \log n)) Lower Bound | concept | 3 | Open |
| Counting Sort and When Integer Keys Break the Lower Bound | concept | 3 | Open |
| External and Practical Sorting: What Real Systems Do | concept | 3 | Open |
| Hashing as a Randomized Model: Expected (O(1)) and When It Fails | concept | 3 | Open |
| Heapsort and the Heap-Based Priority Queue API | concept | 3 | Open |
| Insertion Sort Teaches Lessons That Survive | concept | 3 | Open |
| Learning Resources | resource | 3 | Open |
| Mergesort Is the Divide-and-Conquer Exemplar | concept | 3 | Open |
| Priority-Queue Applications: Simulation, Dijkstra, Top-K, Median | concept | 3 | Open |
| Quicksort and Why Randomization Helps | concept | 3 | Open |
| Radix Sort and Linear in Key Width | concept | 3 | Open |
| Reference and Selective Reading | reference | 3 | Open |
| Search-Data-Structure Choice: Array vs Linked List vs Tree | concept | 3 | Open |
| Selection and Order Statistics in (O(n)) | concept | 3 | Open |
| Sorting, Searching, and Structures: Reading Guide | other | 3 | Open |
| The Binary Heap as an Implicit Tree | concept | 3 | Open |
| Universal Hashing, Load Factor, and Resizing | concept | 3 | Open |