Greedy Algorithms

Sort options

算法基础 (Coursera)

Mar 27th 2023
算法基础 (Coursera)
Course Auditing
Coursera
Peking University
Categories
CS: Theory
Effort
5-12 Weeks
1-4 Hours/Week
Languages
Chinese
Chinese
算法基础 (Coursera)
本课程内容程涵盖枚举、二分、贪心、递归、深度优先搜索、广度优先搜索、动态规划等基本算法。通过大量的高强度的编程训练，提高动手能力，做到能较为熟练、完整、准确地实现自己设计的程序，为进一步学习其他计算机专业课程，或在其他专业领域运用计算机编程解决问题奠定良好的基础。
Recursion
Greedy Algorithms
Dichotomy
Enumeration
Programming
Algorithms
Dynamic Programming
View more details
Mar 27th 2023
Course Auditing
Coursera
Peking University
CS: Theory
5-12 Weeks
1-4 Hours/Week
32.00 EUR/month
Chinese
Chinese

Dynamic Programming, Greedy Algorithms (Coursera)

Mar 20th 2023
Dynamic Programming, Greedy Algorithms (Coursera)
Course Auditing
Coursera
University of Colorado Boulder
Categories
Computer Science
Effort
Advanced
4 Weeks
5-10 Hours/Week
Languages
English
English
Dynamic Programming, Greedy Algorithms (Coursera)
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 [...]
Data Structures and Algorithms Specialization
Dynamic Programming
Greedy Algorithms
Divide and Conquer Algorithms
Algorithms
Python Programming
Data Structures
Quantum Computing
Coursera Plus
View more details
Mar 20th 2023
Course Auditing
Coursera
University of Colorado Boulder
Computer Science
Advanced
4 Weeks
5-10 Hours/Week
68.00 EUR/month
English
English

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

Mar 20th 2023
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming (Coursera)
Course Auditing
Coursera
Stanford University
Categories
CS: Software Engineering
CS: Theory
Effort
Intermediate
4 Weeks
1-4 Hours/Week
Languages
English
Spanish
Russian
Portuguese
French
English
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).
Algorithms Specialization
Algorithms
Greedy Algorithms
Dynamic Programming
Programming
Minimum Spanning Trees
Huffman Codes
Clustering
Scheduling
Computer Science
View more details
Mar 20th 2023
Course Auditing
Coursera
Stanford University
CS: Software Engineering
CS: Theory
Intermediate
4 Weeks
1-4 Hours/Week
41.00 EUR/month
English
Spanish
Russian
Portuguese
French
English