Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Completed by JOSÉ LUCAS DE ARAÚJO GOMES CORDEIRO

October 4, 2020

14 hours (approximately)

View certificate for JOSÉ LUCAS DE ARAÚJO GOMES  CORDEIRO, Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming, an online non-credit course authorized by Stanford University and offered through Coursera