Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Completed by Mihail Filippov
July 2, 2017
14 hours (approximately)
Mihail Filippov'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
