Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019
CppCon · 7 則 HN 推薦
影片問答
可以請 AI 解釋目前片段，或總結整部影片。如果回答附有時間戳記，點選即可跳到對應片段。
試著問：這裡講的是什麼意思？
需使用 Google 登入。確認前可查看最多會扣除多少點數。
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 推薦的原因： HN recommends it as an entertaining talk that starts simple and goes deep on practical performance optimization.
“At first he is just showing simple stuff, but stay with it, he goes deep.” 閱讀 HN 討論 ↗