PickVidsBest Algorithms & data structures Videos
The 60 Algorithms & data structures videos here were recommended by different people across different months. Choose by who it is for: 6 introductory, 24 intermediate, 16 for a general viewer, and 14 for someone who wants the harder derivation. Most of them are a talk. What they share is that one speaker finishes a claim, and the examples exist to hold that claim up. Channels you will keep seeing include CppCon, Google TechTalks, CGP Grey.
CppCon 2015: Sean Parent "Better Code: Data Structures"
Sean Parent's CppCon 2015 talk on better use of standard containers and the goal of having no incidental data structures.
Lower Latency Graph Queries in Cypher with Redis GraphRoi Lipman, Redis LabsTim Davis, Texas A&M U
Redis Labs and Tim Davis present RedisGraph, which uses GraphBLAS to treat graph queries in Cypher as sparse linear algebra for lower latency.
Superpositions, Sudoku, the Wave Function Collapse algorithm.
Martin Donald explains the Wave Function Collapse algorithm using Sudoku-like constraint solving and shows how he implemented it with Blender and Godot.
Stephan T. Lavavej “Floating-Point ＜charconv＞: Making Your Code 10x Faster With C++17's Final Boss”
Stephan T.
What P vs NP is actually about
Polylog explains how algorithms can be turned into circuits and encoded as satisfiability problems, which lets you effectively run them backwards.
What is in a Lucene index? Adrien Grand, Software Engineer, Elasticsearch
Elasticsearch engineer and Lucene committer Adrien Grand explains the design decisions inside a Lucene index and what problems it can and cannot solve.
Fast Inverse Square Root — A Quake III Algorithm
A walkthrough of the Quake III fast inverse square root, explaining where the constant 0x5f3759df comes from.
CRDTs: The Hard Parts
Martin Kleppmann surveys current research on CRDTs, the algorithms for merging concurrent edits across offline replicas.
17. Succinct Structures I
Erik Demaine's MIT 6.851 Advanced Data Structures lecture introducing succinct data structures, covering rank, select and tries.
Infinite Mario AI - Long Level
A bot built by Robin Baumgarten plays Infinite Mario using A* path-finding, shown as a red planned path that updates as new obstacles appear.
Bryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017
Bryan Cantrill presents the ARC (Adaptive Replacement Cache) paper by Megiddo and Modha at Papers We Love.
Algorithmic Redistricting: Elections made-to-order
AlphaPhoenix uses Monte Carlo simulation and annealing-style methods to draw North Carolina congressional district maps, both gerrymandered and fair.
Differential Synchronization
Neil Fraser of Google presents Differential Synchronization, the algorithm behind MobWrite, for keeping multiple copies of a document in sync in real time.
I Solved Klotski
2swap explains how he solved the Klotski sliding-block puzzle by mapping its full state space as a graph and visualizing it.
High-performance Tree Wrangling, the APL Way // Aaron Hsu // Dyalog '18
Aaron Hsu shows how to manipulate and transform tree data in APL using arrays and inverted tables instead of pointers.
Parsing JSON Really Quickly: Lessons Learned
Daniel Lemire's QCon talk on how simdjson parses gigabytes of JSON per second.
Quick-sort with Hungarian (Küküllőmenti legényes) folk dance
Hungarian folk dancers from Sapientia University act out the quicksort algorithm step by step, with music.
Donald Knuth: Algorithms, Complexity, and The Art of Computer Programming | Lex Fridman Podcast #62
Lex Fridman interviews Donald Knuth about algorithms, complexity, The Art of Computer Programming, and his work habits.
Abseil's Open Source Hashtables: 2 Years In - Matt Kulukundis - CppCon 2019
Matt Kulukundis reviews two years of Abseil's Swiss table hashtable, covering post-release optimizations, lessons from rolling it out across Google, design choices, and what global monitoring revealed.
C++Now 2018: You Can Do Better than std::unordered_map: New Improvements to Hash Table Performance
Malte Skarupke's C++Now 2018 talk on hash table performance, explaining why std::unordered_map is slow and memory hungry and presenting faster designs, including his bytell hash map.
Who's faster around London: a taxi driver or a GPS?
Tom Scott races a London black-cab driver who has memorized The Knowledge against a phone GPS across the city, comparing local expertise to navigation software.
Three Beautiful Quicksorts
Jon Bentley walks through three implementations of Hoare's Quicksort, from a dozen-line C function to a series of systematic code transformations that make the program ever simpler and more powerful.
BetrFS: A Right-Optimized Write-Optimized File System
A Microsoft Research talk on BetrFS, a file system built on B-epsilon trees, a write-optimized data structure.
The Josephus Problem - Numberphile
Numberphile with Daniel Erman on the Josephus problem, where people in a circle are eliminated in turn.