Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Completed by Puzhen Qian
September 3, 2017
14 hours (approximately)
Puzhen Qian'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

