Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Tim Roughgarden
The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
More resources on Greedy Algorithms
Khan Academy - Greedy Algorithms
Interactive beginner-friendly lessons
CP-Algorithms - Greedy
Competitive programming focused greedy techniques
GeeksforGeeks - Greedy Algorithms
Tutorials, problems, and explanations
Algorithms, Part I
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms. All the features of this course are available for free. People who are interested in digging deeper into the content may wish to obtain the textbook Algorithms, Fourth Edition (upon which the course is based) or visit the website algs4.cs.princeton.edu for a wealth of additional material. This course does not offer a certificate upon completion.
geeksforgeeks.org
GeeksforGeeks is a comprehensive computer science learning platform offering tutorials, articles, and coding exercises on algorithms, data structures, and programming languages. It provides detailed explainers and practice problems, including greedy algorithms, dynamic programming, graph topics, and interview preparation.
Algorithms, Part II
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms. All the features of this course are available for free. People who are interested in digging deeper into the content may wish to obtain the textbook Algorithms, Fourth Edition (upon which the course is based) or visit the website algs4.cs.princeton.edu for a wealth of additional material. This course does not offer a certificate upon completion.