Greedy Algorithms

Sort options

Dynamic Programming, Greedy Algorithms (Coursera)

Aug 9th 2021
Dynamic Programming, Greedy Algorithms (Coursera)
Course Auditing
Categories
Effort
Languages
This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. We will also cover some advanced topics in data [...]
0
No votes yet

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Coursera)

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).
5
Average: 5 ( 3 votes )

算法基础 (Coursera)

Jul 19th 2021
算法基础 (Coursera)
Course Auditing
Categories
Effort
Languages
本课程内容程涵盖枚举、二分、贪心、递归、深度优先搜索、广度优先搜索、动态规划等基本算法。通过大量的高强度的编程训练,提高动手能力,做到能较为熟练、完整、准确地实现自己设计的程序,为进一步学习其他计算机专业课程,或在其他专业领域运用计算机编程解决问题奠定良好的基础。
0
No votes yet
Jul 19th 2021
Course Auditing
32.00 EUR/month