Michael Sambol

7:10

Analyzing algorithms in 7 minutes — Asymptotic Notation

6:29

Analyzing algorithms in 6 minutes — Intro

5:20

AVL trees in 5 minutes — Deletions

9:00

AVL trees in 9 minutes — Insertions

5:00

AVL trees in 5 minutes — Intro & Search

3:10

Fibonacci heaps in 3 minutes — Delete

9:14

Fibonacci heaps in 9 minutes — Decrease Key

8:05

Fibonacci heaps in 8 minutes — Extract Min

6:17

Fibonacci heaps in 6 minutes — Insert & Union

4:00

Binary search in 4 minutes

6:37

Fibonacci heaps in 6 minutes — Intro

5:49

Red-black trees in 6 minutes — Delete Fixes

8:13

Red-black trees in 8 minutes — Deletions

6:00

B-trees in 6 minutes — Deletions

6:36

B-trees in 6 minutes — Insertions

4:07

B-trees in 4 minutes — Search

5:38

B-trees in 6 minutes — Properties

3:57

B-trees in 4 minutes — Intro

5:56

Heaps in 6 minutes — Methods

3:29

Heaps in 3 minutes — Intro

3:52

Hash tables in 4 minutes

3:10

Queues in 3 minutes

2:59

Stacks in 3 minutes

4:22

Linked lists in 4 minutes

4:01

Depth-first search in 4 minutes

3:59

Breadth-first search in 4 minutes

5:13

Big-O notation in 5 minutes

5:10

Red-black trees in 5 minutes — Insertions (examples)

5:38

Red-black trees in 5 minutes — Insertions (strategy)

3:05

Red-black trees in 3 minutes — Rotations

3:54

Red-black trees in 4 minutes — Intro

4:24

Quick sort in 4 minutes

4:13

Heap sort in 4 minutes

3:03

Merge sort in 3 minutes

2:10

Bubble sort in 2 minutes

2:43

Selection sort in 3 minutes

2:19

Insertion sort in 2 minutes

4:33

Floyd–Warshall algorithm in 4 minutes

3:20

Level-order tree traversal in 3 minutes

2:19

Post-order tree traversal in 2 minutes

2:55

In-order tree traversal in 3 minutes

2:46

Pre-order tree traversal in 3 minutes

5:15

Ford-Fulkerson in 5 minutes

5:10

Bellman-Ford in 5 minutes — Step by step example

3:57

Bellman-Ford in 4 minutes — Theory

2:46

Dijkstra's algorithm in 3 minutes

1:49

Kruskal's algorithm in 2 minutes

2:17

Prim's algorithm in 2 minutes