Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019

Discussion & Comments: Presentation Slides, PDFs, Source Code and other presenter materials are available at: Sorting Algorithms: Speed Is Found In The Minds of People In all likelihood, sorting is one of the most researched classes of algorithms. It is a fundamental task in Computer Science, both on its own and as a step in other algorithms. Efficient algorithms for sorting and searching are now taught in core undergraduate classes. Are they at their best, or is there more blood to squeeze from that stone? This talk will explore a few less known – but more allegro! – variants of classic sorting algorithms. And as they say, the road matters more than the destination. Along the way, we’ll encounter many wondrous surprises and we’ll learn how to cope with the puzzling behavior of modern complex architectures. — Andrei Alexandrescu Andrei Alexandrescu is a researcher, software engineer, and author. He wrote three best-selling books on programming (Modern C Design, C Coding Standards, and The D Programming Language) and numerous articles and papers on wide-ranging topics from programming to language design to Machine Learning to Natural Language Processing. Andrei holds a PhD in Computer Science from the University of Washington and a BSc in Electrical Engineering from University “Politehnica“ Bucharest. He is the Vice President of the D Language Foundation. — Videos Filmed & Edited by Bash Films: *-----* Register Now For CppCon 2022: *-----*