Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
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).
Affiliate disclosure: Course Kingdom participates in affiliate programmes (including Udemy via the Cuelinks network). Some links on this page are affiliate links — if you click and enroll, we may earn a small commission at no extra cost to you. Learn more.
