Все публикации

0:16:17

A* Search: How Your Map Applications Find Shortest Routes

0:29:24

The Discrete Fourier Transform: Most Important Algorithm Ever?

0:30:27

The Traveling Salesman Problem: When Good Enough Beats Perfect

0:25:26

PageRank: A Trillion Dollar Algorithm

0:32:00

How PNG Works: Compromising Speed for Quality

0:34:48

The Unreasonable Effectiveness of JPEG: A Signal Processing Approach

0:28:00

How Computers Draw Weird Shapes (Marching Squares)

0:29:11

Huffman Codes: An Information Theory Perspective

0:31:53

A Strange But Elegant Approach to a Surprisingly Hard Problem (GJK Algorithm)

0:28:05

Building Collision Simulations: An Introduction to Computer Graphics

0:07:39

FFT Example: Unraveling the Recursion

0:28:23

The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?

0:10:41

Breadth First Search (BFS): Visualized and Explained

0:21:27

5 Simple Steps for Solving Dynamic Programming Problems

0:20:52

Depth First Search (DFS) Explained: Algorithm, Examples, and Code

0:16:26

Introduction to Graph Theory: A Computer Science Perspective

0:21:13

Towers of Hanoi: A Complete Recursive Visualization

0:17:45

What Is Big O Notation?

0:21:03

5 Simple Steps for Solving Any Recursive Problem

0:07:53

The Simple and Elegant Idea behind Efficient Dynamic Arrays

0:14:21

What if you had to invent a dynamic array?

0:03:44

What Actually Is a Data Structure?

0:03:36

A Preview for Data Structures and Algorithms