1299 тысяч подписчиков
48 видео
Merge sort in 3 minutes
Quick sort in 4 minutes
Bubble sort in 2 minutes
Insertion sort in 2 minutes
Selection sort in 3 minutes
Heap sort in 4 minutes
Heaps in 6 minutes — Methods
Ford-Fulkerson in 5 minutes
Level-order tree traversal in 3 minutes
Heaps in 3 minutes — Intro
Kruskal's algorithm in 2 minutes
Depth-first search in 4 minutes
Hash tables in 4 minutes
Stacks in 3 minutes
Red-black trees in 5 minutes — Insertions (strategy)
Breadth-first search in 4 minutes
Bellman-Ford in 4 minutes — Theory
B-trees in 6 minutes — Properties
B-trees in 6 minutes — Insertions
AVL trees in 5 minutes — Intro & Search
Post-order tree traversal in 2 minutes
Red-black trees in 4 minutes — Intro
In-order tree traversal in 3 minutes
Analyzing algorithms in 6 minutes — Intro
B-trees in 6 minutes — Deletions
Dijkstra's algorithm in 3 minutes
Big-O notation in 5 minutes
Queues in 3 minutes
Analyzing algorithms in 7 minutes — Asymptotic Notation
Fibonacci heaps in 6 minutes — Insert & Union
Pre-order tree traversal in 3 minutes
AVL trees in 9 minutes — Insertions
Bellman-Ford in 5 minutes — Step by step example
Fibonacci heaps in 9 minutes — Decrease Key
Red-black trees in 8 minutes — Deletions
Floyd–Warshall algorithm in 4 minutes
Fibonacci heaps in 8 minutes — Extract Min
Fibonacci heaps in 3 minutes — Delete
Binary search in 4 minutes
B-trees in 4 minutes — Intro
Fibonacci heaps in 6 minutes — Intro
