Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Completed by Jakub Martin

March 29, 2017

14 hours (approximately)

View certificate for Jakub Martin, Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming, an online non-credit course authorized by Stanford Online and offered through Coursera