Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Completed by Gert de Pagter

March 21, 2019

4 weeks of study, 4-8 hours/week

View certificate for Gert de Pagter, Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming, an online non-credit course authorized by Stanford University and offered through Coursera