We will learn some divide and conquer algorithms for Integer Multiplication (Karatsuba’s Algorithm), Matrix Multiplication (Strassen’s Algorithm), Fast Fourier Transforms (FFTs), and Finding Closest ...

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. ... We will understand the basic design principles for greedy algorithms and learn about a few algorithms for greedy ... Duration ...