Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Completed by éric leclercq
December 27, 2016
14 hours (approximately)
éric leclercq's account is verified. Coursera certifies their successful completion of Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Skills you will gain
- Category: Algorithms
- Category: Data Structures
- Category: Computational Thinking
- Category: Bioinformatics
- Category: Graph Theory
