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 structures.阅读更多.
此资源由附属合作伙伴提供。 如果您支付培训费用，我们可能会赚取佣金来支持该网站。
The techniques and tools covered in Dynamic Programming, Greedy Algorithms are most similar to the requirements found in 数据科学家 data science job advertisements.
Dynamic Programming, Greedy Algorithms is a part of 一 structured learning path.
3 Courses
3 Months
Data Science Foundations: Data Structures and Algorithms
