Dynamic Programming, Greedy Algorithms
Completed by Daniel Smith
November 17, 2022
38 hours (approximately)
Daniel Smith's account is verified. Coursera certifies their successful completion of Dynamic Programming, Greedy Algorithms
What you will learn
Describe basic algorithm design techniques
Create divide and conquer, dynamic programming, and greedy algorithms
Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems
Skills you will gain
- Category: Algorithms
- Category: Python Programming
- Category: Data Structures
- Category: Applied Mathematics
- Category: Computational Thinking
- Category: Theoretical Computer Science
- Category: Analysis
- Category: Quantum computing
- Category: Design Strategies
