Skip to content
Home
Explore
Themes
Season 6: Heaps, Sorting, and Tries — episodes
Heaps as arrays
Getting to the bottom of the heap...sort.
You can count on counting sort
Radix sort: the patient zero of sorting algorithms
Tries: the golden retriever of data structures
Dear tries, you (auto)complete me
The cannibalistic efficiency of radix trees
Meet our good friend PATRICIA