Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019
7 人推荐 · 跨 6 个月 · 2019–2024
中文导读
Andrei Alexandrescu 在 CppCon 2019 上的高能演讲：重新审视排序算法，展示了如何通过无分支（branchless）技巧、混合策略以及精准的代价评估模型，在现代硬件上大幅压榨并提升类 std::sort 算法的极致性能。
为什么 HN 推它
既风趣幽默又极具深度的工程性能优化神作，由浅入深层层剥开现代体系结构下的软硬件协同考量。
「刚开始他讲的内容看着很简单，但一定要耐心看下去，后面的深度绝对惊艳。」HN 网友原话：At first he is just showing simple stuff, but stay with it, he goes deep.
英文原摘要（HackerTube / Claude 整理）
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 modern hardware.
HN recommends it as an entertaining talk that starts simple and goes deep on practical performance optimization.
HN 上的提及
Andrei Alexandrescu gave a great talk at this year's CppCon about practical sorting
I saw a great talk at CppCon 2019 by Andrei Alexandrescu about speeding up std::sort.
If this question intress you, it is worth watching.
I enjoyed Alexandrescu’s CppCon 2019 talk
Generic implementations cannot exploit data properties