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

Learn how to represent iteration in programming with Bitesize KS3 Computer Science. ... For example, a very simple algorithm for eating breakfast cereal might consist of these steps: ...