Sort by

Newest

Oldest

Popular

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