Coursera | Online Courses & Credentials From Top Educators. Join for Free | Coursera

Completed by Gert de Pagter

March 21, 2019

4 weeks of study, 4-8 hours/week

Gert de Pagter's account is verified. Coursera certifies their successful completion of Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Skills you will gain

Spanning TreeAlgorithmsDynamic ProgrammingGreedy Algorithm

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