16:17
A* Search: How Your Map Applications Find Shortest Routes
29:24
The Discrete Fourier Transform: Most Important Algorithm Ever?
30:27
The Traveling Salesman Problem: When Good Enough Beats Perfect
25:26
PageRank: A Trillion Dollar Algorithm
32:00
How PNG Works: Compromising Speed for Quality
34:48
The Unreasonable Effectiveness of JPEG: A Signal Processing Approach
28:00
How Computers Draw Weird Shapes (Marching Squares)
29:11
Huffman Codes: An Information Theory Perspective
31:53
A Strange But Elegant Approach to a Surprisingly Hard Problem (GJK Algorithm)
28:05
Building Collision Simulations: An Introduction to Computer Graphics
07:39
FFT Example: Unraveling the Recursion
28:23
The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
10:41
Breadth First Search (BFS): Visualized and Explained
21:27
5 Simple Steps for Solving Dynamic Programming Problems
20:52
Depth First Search (DFS) Explained: Algorithm, Examples, and Code
16:26
Introduction to Graph Theory: A Computer Science Perspective
21:13
Towers of Hanoi: A Complete Recursive Visualization
17:45
What Is Big O Notation?
21:03
5 Simple Steps for Solving Any Recursive Problem
07:53
The Simple and Elegant Idea behind Efficient Dynamic Arrays
14:21
What if you had to invent a dynamic array?
03:44
What Actually Is a Data Structure?
03:36
A Preview for Data Structures and Algorithms
X
About
This channel is all about animating computer science concepts in a fun, interactive, and intuitive manner.
Tags