Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019
CppCon · 6 位 HN 用户推荐 · 2019–2023
If you're interested in these types of implementation/optimization details, Andrei Alexandrescu gave a great talk at this year's CppCon about practical sorting, e.g. when to break out of quicksort to something else: [link]
— United857, 2019The article is C++, so not sure why you are bringing up AOT/JIT since it doesn't apply here. And clearly there is a large gain possible by doing a calculation rather than a conditional with a high entropy result, otherwise, the article's mentioned speedup wouldn't have happened. A PGO feedback loop isn't going to do anything on a high entropy conditional. I saw a great talk at CppCon 2019 by Andre
— planteen, 2019If this question intress you, it is worth watching. [0]: [link]
— nestorD, 2019Andrei has a pretty amazing CppCon talk similar to this: [link]
— ketanhwr, 2021Not exactly a lecture series, but Andrei Alexandrescu has had some fantastic keynote presentations at CppCon. I don't even program in C++ any more, but I've watched these more than once, they're entertaining, approachable, and inspiring: Speed Is Found In The Minds of People [link]
— jiggawatts, 2023Here's an excellent example of what GP said: [link] (long video, skip to 26:00 if you are in a hurry)
— r_sreeram, 2023