The problem of sorting Input: sequence(a1, a2,.,an,of numbers Output: permutation (al, a2,..., an such that a1≤a2≤…≤an Example: put:824936 Output: 23 4689 Day 1 Introduction to Algorithms L16Day 1 Introduction to Algorithms L1.6 The problem of sorting Input: sequence 〈a1, a2, …, an〉 of numbers. Example: Input: 8 2 4 9 3 6 Output: 2 3 4 6 8 9 Output: permutation 〈a'1, a'2, …, a'n〉 such that a'1 ≤ a'2 ≤ … ≤ a'n