sorting algorithms

A visualization and sonification of 15 sorting algorithms, from selection sort to bogo sort, run on shuffled integers in six minutes. Each algorithm gets a size and speed scaled to its complexity.

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.

A JSConf 2014 talk visually breaking down algorithms behind everyday UI patterns, such as dropdown menus that vanish when the mouse drifts and picking the nearest target to the cursor. It shows how these are implemented in JavaScript.

A three-minute capture of SORTDEMO.BAS, the sorting visualization that shipped with QBasic. It animates insertion, bubble, heap, exchange, shell and quick sort with chiptune-like sound.

Hungarian folk dancers from Sapientia University act out the quicksort algorithm step by step, with music. It is part of the AlgoRythmics series of sorting algorithms performed as dance.

Tom Scott-style absurdist tour by Tom7 of SIGBOVIK chess projects: a tournament of 30 weird chess algorithms used to rate a color- and piece-blind chess program. Topics include mirrors, arithmetic encoding, perverted game tree search and a diluted Stockfish.

Lex Fridman interviews Donald Knuth about algorithms, complexity, The Art of Computer Programming, and his work habits. The conversation covers his approach to verifying algorithms and how he organises his time.

A short tour of a UK materials recycling facility showing how mixed recyclables are mechanically and optically sorted. Aluminum, ferrous metal, glass, paper, and trash come out as separate streams.

Glenn Vanderburg presents Cló, a Clojure library that reimplements TeX's core typesetting algorithms as composable functions. He shows what translating procedural, literate-programming code into functional form teaches.

Chandler Carruth's CppCon 2014 talk on writing fast C++, explaining why data structure choice and memory layout matter more than clever algorithms. It covers why standard containers like unordered_map perform poorly on modern CPUs.

Guy Steele presents a small geometric problem and compares four computational approaches: a classic sequential solution and three parallel-friendly ones. Each is illustrated pictorially and with working code, weighing total work against time to solution.

Dave Ackley demonstrates the Demon Horde Sort, an inherently robust sorting machine running in his Movable Feast Machine simulator. This is the uncut version with all details and side thoughts.

Tom Scott's Royal Institution discourse on science communication in the age of social media, how recommendation algorithms shape popularity, and why view counts can matter more than truth. It includes a segment on parasocial relationships.

Erik Demaine's MIT 6.006 lecture introducing dynamic programming through Fibonacci numbers and shortest paths. It covers memoization, subproblems and optimal substructure.

Bryan Cantrill presents the ARC (Adaptive Replacement Cache) paper by Megiddo and Modha at Papers We Love. He opens with a survey of caching strategies before digging into the self-tuning LRU/MFU design.

Edward Kmett's 2013 talk at Prezi in Budapest on succinct data structures, which store data in close to the information-theoretic minimum space while supporting fast queries. It ties together the research and walks through his Haskell succinct library.

A short CGP Grey bonus video explaining the shortest-splitline algorithm, which draws electoral districts by repeatedly splitting a state along its shortest dividing line while balancing population. It is offered as a neutral, algorithmic fix for gerrymandering.

Moleman 2 is a feature-length documentary about the demoscene, tracing its rise from 1980s Commodore 64 culture to modern real-time art. It explains the algorithms and creative process behind demos and intros.

Sean Parent's GoingNative 2013 talk surveys new and overlooked C++ features and shows how to use them for simple, correct, clear code. It stresses using standard algorithms rather than raw loops.

Psychologist Robert Epstein presents a Stanford EE380 colloquium on how internet algorithms such as search rankings can manipulate opinions, purchases and votes at massive scale. He also describes a new monitoring system for tracking such influence.

A restored 1994 video of Karl Sims' research on evolved virtual creatures, where simulated block creatures are bred through artificial evolution to swim, walk, follow and compete. It is a landmark demonstration of genetic algorithms in physics simulation.

Martin Kleppmann's QCon London 2018 talk on keeping data consistent in distributed systems without a central leader. It surveys CRDT algorithms for syncing devices and collaborative editing over peer-to-peer networks.

Stephan T. Lavavej's CppCon 2019 talk on implementing floating-point to_chars and from_chars in Microsoft's C++ STL. It covers the history of float-string conversion and the algorithms that make it much faster.

Andrei Alexandrescu's ACCU 2016 talk previews material from his book on writing fast code, with a focus on optimization techniques such as sentinels and faster search.

Technosociologist Zeynep Tufekci argues that the machine-learning systems used to serve ads also decide what political and social information people see. She explains how opaque algorithms can nudge, segment and manipulate users, and warns that the real danger is powerful people using AI to control populations.

Dave Ackley gives a high-level introduction to robust-first computing, which prioritizes robustness over efficiency in computer architecture. A sorting demo illustrates the idea.

Lukas Eder's Devoxx talk on how modern cost-based SQL optimizers rewrite and plan queries in ways developers would not expect. It argues that declarative SQL, used well, can run complex queries very fast.

A Channel 4 News interview with technologist Jaron Lanier, who argues that social media damages people's lives. He discusses how Facebook, YouTube and Google use algorithms and data collection to shape what users see.

Writer and artist James Bridle shows how strange and disturbing children's videos on YouTube, from surprise eggs to algorithmic mashups, are produced for ad revenue. He argues they reveal problems in a data-driven internet.

In a TEDGlobal talk, Raffaello D'Andrea demonstrates quadcopters that play catch, balance, learn and coordinate, using algorithms that treat them like athletes. It includes Kinect-controlled quads.

Matt Kulukundis explains how Google designed SwissTable, a fast, cache-friendly hash table, step by step from std::unordered_map. The talk covers open addressing, SIMD probing and the tradeoffs of changing a fundamental data structure.

Python core developer Raymond Hettinger explains how Python's dictionary implementation evolved into the compact, ordered dict in Python 3.6. He uses pictures and small bits of pure Python, and covers key-sharing, compaction and versioning.

Juan Pedro Bolivar Puente explains immutable and persistent data structures in C++ and how they support value semantics. He presents the Immer library, rrb-trees, and a prototype text editor that opens a huge file instantly.

CGP Grey compares airplane boarding methods, based on an arXiv paper, and shows why the intuitive back-to-front approach is slow while random or outside-in boarding does better.

Donald Knuth's 2017 Christmas Tree Lecture at Stanford about a combinatorial geometry problem whose computed numbers matched a striking formula. He tells the story of the conjecture and its sequel.

A 2007 Google Tech Talk in which Cliff Click of Azul Systems presents a lock-free concurrent hash table that scales to 768 CPUs. He explains why it is correct by reasoning in a different way than usual happens-before and memory-order arguments.

A Dyalog demonstration of developing a Sudoku solver in APL, using an algorithm by Arthur Whitney with performance work by John Scholes. The narration steps through the array-oriented solution.

Lee Byron of Facebook explains how persistent immutable data structures work and how to use them in React apps with Immutable.js. He covers memoization benefits and avoiding coupling through shared mutable state.

John Scholes builds a depth-first tree-search operator step by step in a Dyalog APL session. It covers higher-order functions and runs the search on the N-Queens problem.

Two Google engineers perform a mock coding interview and then discuss best practices for candidates, including asking clarifying questions and communicating while solving.