Chapter 4
Algorithm Design Paradigms
Section 1
Lesson Overview
In the last lesson, we learned about hash tables and binary search trees. Today, we will start with the algorithm design paradigms. These design patterns can be seen as the generic methods or approaches that motivate the design of a class of algorithms. Just as an algorithm is a higher abstraction than a computer program, an algorithm design paradigm is an abstraction higher than an algorithm. The choice of an algorithm paradigm is an important one when designing an algorithm. This lesson will focus on the following three algorithm paradigms: - Greedy - Divide and conquer - Dynamic programming