Three Beautiful Quicksorts
Why it was recommended
If you're looking for programming inspiration I love these videos
Recommendationtonym128 · Original
What it covers
Jon Bentley walks through three implementations of Hoare's Quicksort, from a dozen-line C function to a series of systematic code transformations that make the program ever. It is for someone who already knows the basic terms and wants the next step.
Video details
- Channel
- Google TechTalks
- Length
- 53 min 56 sec
- Year
- 2007
More in this topic
- CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
- The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
- Modern Dictionaries by Raymond Hettinger
- CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
- CppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”
- Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019