Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Completed by Anton Kan
April 8, 2018
14 hours (approximately)
Anton Kan'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: Graph Theory
- Category: Bioinformatics
