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

Researchers have devised an "absurdly fast" algorithm to solve the problem of finding the fastest flow through a network.