In this module the student will learn the very basics of algorithms through three ... Next, we introduce the heap data structure and the basic properties of heaps. This is followed by algorithms for ...

It 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) . We will ...