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

Completed by MARIANO LEONEL ACOSTA

October 15, 2020

14 hours (approximately)

MARIANO LEONEL ACOSTA's account is verified. Coursera certifies their successful completion of Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Stanford University

4.8 (1,274 ratings)

|

81,595 already enrolled

Enroll for Free

Skills you will gain

Bioinformatics
Graph Theory
Algorithms
Data Structures
Computational Thinking
Theoretical Computer Science

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