21:13Towers of Hanoi: A Complete Recursive Visualization
Reducible679K views
Towers of Hanoi solved recursively, with a full visualisation of the recursion.
267,244 videos · Algorithms, systems, security, machine learning and building software.
21:13679K views
Towers of Hanoi solved recursively, with a full visualisation of the recursion.
11:011.43M views
Minimax and alpha-beta pruning, explained with game trees.
32:00752K views
How PNG compression works: filtering, LZ77 and Huffman coding in DEFLATE.
16:26Intro806K views
An introduction to graph theory for programmers: representations, traversals and classic problems.
30:27380K views
The travelling salesman problem: why it's hard, and the exact, approximate and heuristic approaches used to attack it.

965K views
Tom 7 pits 30 deliberately weird chess algorithms against each other and explains how Elo ratings work.
17:45338K views
Big O notation: what asymptotic complexity means and how to reason about algorithm running time.
14:041.32M views
The A* search algorithm and how a heuristic improves on Dijkstra for pathfinding.
12:401.08M views
Lambda calculus: Church's minimal model of computation, functions, and how it encodes logic.
16:17101K views
How A* search finds shortest paths, building up from Dijkstra's algorithm and admissible heuristics.
34:481.26M views
How JPEG compression exploits human vision: colour spaces, chroma subsampling, the DCT and quantisation.
29:11292K views
Huffman coding and the information theory behind it: entropy, prefix codes and why Huffman's construction is optimal.

3.69M views
Hackerdashery explains P, NP, NP-completeness and the wider 'complexity zoo' with clear animations.
28:00431K views
Marching squares: how computers draw implicit curves and metaballs, including ambiguous cases and interpolation.

697K views
Computerphile explains the discrete cosine transform at the heart of JPEG compression.

764K views
Martin Donald explains the wave function collapse algorithm for procedural generation, using sudoku to build intuition.
6:33124K views
Turing's proof that the halting problem is undecidable.
10:4153.6K views
How bzip2 works, centred on the Burrows–Wheeler transform.
8:45
15:34185K views
Hierholzer's algorithm for Eulerian paths and circuits.
15:01300K views
Bellman–Ford shortest paths and detecting negative cycles.
6:03159K views
Bloom filters: probabilistic set membership with no false negatives.
8:312.1M views
Dijkstra's shortest-path algorithm, step by step.
13:25673K views
Max flow with the Ford–Fulkerson method: residual graphs and augmenting paths.
14:37276K views
How computers play games with the minimax algorithm, searching game trees to choose the best move.
8:51206K views
Balanced binary search tree rotations, the basis of AVL trees.
9:35240K views
The Edmonds–Karp max-flow algorithm using BFS augmenting paths.
9:4166.6K views
When Eulerian paths and circuits exist in directed and undirected graphs.

6.02M views
How Quake III's fast inverse square root works: IEEE 754 bit layout, the 0x5f3759df constant as a log approximation and a Newton step.
24:13767K views
Drawing the Ulam spiral to visualise patterns in prime numbers.
9:22Intro164K views
An introduction to dynamic programming through counting dice-roll outcomes.
10:32Intro219K views
An introduction to propositional logic: statements, connectives, truth tables and implication.
10:05A 10-minute video from Wandida, EPFL: “google page rank كيفاش كيرتّب گوگل نتائج البحث ؟”.
5:59Intro
A 6-minute video from Craig'n'Dave: “13. EDEXCEL GCSE (1CP2) Linear search”.
7:02A 7-minute video from Craig'n'Dave: “67. EDEXCEL GCSE (1CP2) Using abstraction and decomposition to solve problems”.
9:04A 9-minute video from Universitat Politècnica de València - UPV: “Encaminamiento por Inundación | | UPV”.