4videosReducible
338K subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
Playlists · 4
21:035 Simple Steps for Solving Any Recursive Problem
1.56M views
How to think recursively, with progressively harder examples.
21:275 Simple Steps for Solving Dynamic Programming Problems
1.52M views
A framework for solving dynamic programming problems, with worked examples.
31:53A Strange But Elegant Approach to a Surprisingly Hard Problem (GJK Algorithm)
381K views
The GJK algorithm for collision detection between convex shapes, using Minkowski differences and support functions.
16:17A* Search: How Your Map Applications Find Shortest Routes
101K views
How A* search finds shortest paths, building up from Dijkstra's algorithm and admissible heuristics.
28:05Building Collision Simulations: An Introduction to Computer Graphics
Intro539K views
Building a collision simulation: particle motion, collision detection, response and spatial partitioning.
20:52Depth First Search (DFS) Explained: Algorithm, Examples, and Code
548K views
Depth-first search: the algorithm, its recursion, examples and code, including cycle detection and topological sort.
28:00How Computers Draw Weird Shapes (Marching Squares)
431K views
Marching squares: how computers draw implicit curves and metaballs, including ambiguous cases and interpolation.
32:00How PNG Works: Compromising Speed for Quality
752K views
How PNG compression works: filtering, LZ77 and Huffman coding in DEFLATE.
29:11Huffman Codes: An Information Theory Perspective
292K views
Huffman coding and the information theory behind it: entropy, prefix codes and why Huffman's construction is optimal.
16:26Introduction to Graph Theory: A Computer Science Perspective
Intro806K views
An introduction to graph theory for programmers: representations, traversals and classic problems.
30:27The Traveling Salesman Problem: When Good Enough Beats Perfect
380K views
The travelling salesman problem: why it's hard, and the exact, approximate and heuristic approaches used to attack it.
34:48The Unreasonable Effectiveness of JPEG: A Signal Processing Approach
1.26M views
How JPEG compression exploits human vision: colour spaces, chroma subsampling, the DCT and quantisation.
21:13Towers of Hanoi: A Complete Recursive Visualization
679K views
Towers of Hanoi solved recursively, with a full visualisation of the recursion.
17:45What Is Big O Notation?
338K views
Big O notation: what asymptotic complexity means and how to reason about algorithm running time.
10:41Breadth First Search (BFS): Visualized and Explained
408K views
A 11-minute video from Reducible's catalogue; the title names its topic.
7:39FFT Example: Unraveling the Recursion
102K views
A 8-minute video from Reducible's catalogue; the title names its topic.
7:53The Simple and Elegant Idea behind Efficient Dynamic Arrays
66.7K views
A 8-minute video from Reducible's catalogue; the title names its topic.
14:21What if you had to invent a dynamic array?
144K views
A 14-minute video from Reducible's catalogue; the title names its topic.