Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Completed by DANG HAI NGUYEN
June 22, 2017
14 hours (approximately)
DANG HAI NGUYEN's account is verified. Coursera certifies their successful completion of Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Skills you will gain
- Category: Computational Thinking
- Category: Algorithms
- Category: Data Structures
- Category: Graph Theory
- Category: Bioinformatics
