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).
Implementing Kruskal's Algorithm via Union-Find II
Loading...
Skills You'll Learn
Spanning Tree, Algorithms, Dynamic Programming, Greedy Algorithm
Reviews
4.8 (1,197 ratings)
- 5 stars86.54%
- 4 stars11.44%
- 3 stars1.67%
- 2 stars0.08%
- 1 star0.25%
AB
Apr 22, 2020
Like the other courses in this specialization, the material is interesting and coherent. The pace is not fast enough to get lost and not so slow to insult your intelligence. I enjoyed it a lot!
SW
Feb 24, 2019
One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.
From the lesson
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
Taught By
Tim Roughgarden
Professor
Explore our Catalog
Join for free and get personalized recommendations, updates and offers.
Coursera Footer
© 2022 Coursera Inc. All rights reserved.
