Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Completed by Stepan Naumov
July 28, 2018
14 hours (approximately)
Stepan Naumov'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: Computational Thinking
- Category: Data Structures
- Category: Graph Theory
- Category: Bioinformatics
