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

For example, a very simple algorithm ... bowl and spoon The algorithm will repeat steps 3 and 4 until all the cereal and milk has been eaten. Iteration is implemented in programming using FOR ...