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

The newly-minted Republican contender in what could be one of November’s key Senate races says he regrets using the words “divide and conquer” in a 2011 speech while describing those who are ...