The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).

- Learn>
- Computer Science>
- Algorithms>
- Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming course>
- Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional]

Loading...

Course video 28 of 53

Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).

The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).

Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm

#### Tim Roughgarden

Professor

Courses, Specializations, and Online Degrees taught by top instructors from the world's best universities and educational institutions.

Join a **community** of **40 million learners** from around the world

Earn a skill-based **course certificate** to apply your knowledge

Coursera provides universal access to the world’s best education,
partnering with top universities and organizations to offer courses online.