1 Introduction to Algorithm design and analysis Example: sorting problem. Input: a sequence of n number a 1, a 2, …,a n Output: a permutation (reordering)
