Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Completed by Kurt Han Peek
September 12, 2017
14 hours (approximately)
Kurt Han Peek'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: Graph Theory
- Category: Bioinformatics
- Category: Data Structures
- Category: Algorithms
