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 ...

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. Course ...

This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for computational geometry. We will discuss how to use these techniques ...

I am a data science graduate at the University of Colorado Boulder. I will be facilitating the following Coursera courses: DTSA 5501 - Algorithms for Searching, Sorting, and Indexing; DTSA 5502 - ...