Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019
Why it was recommended
At first he is just showing simple stuff, but stay with it, he goes deep.
Strong recommendationbboreham · Original
What it covers
Andrei Alexandrescu's CppCon 2019 talk revisits sorting, showing how branchless tricks, hybrid strategies and a cost metric can speed up std::sort-style algorithms on. It is for someone who wants the derivation, proof, or implementation detail.
Video details
- Channel
- CppCon
- Length
- 1 hr 29 min
- Year
- 2019
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”
- The Fastest Way to Board a Plane Feels Like the Slowest