This online course explores greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
| Instructor: | Professor Tim Roughgarden |
| Provided by: | Coursera |
| Course language: | English |
| Fees: | free course |
| Level: | intermediate |
| Certificate available? | (fee) |
| Format: | MOOC/online course |
How do you like the course 'Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming'?
