1. Sorting problem: We are given a sequence of numbers x1, x2, xn. We scan these numbers from left to right, and put xi to left of xin if xais smaller than xi-1. n other words, we continuously move x to the left until the numbers to its left are all smaller than or equal to it. Design an algorithm to resolve this sorting problem.

2. Please analyze the time complexity of your above designed algorithm, in terms of both the best case and worst case complexities.

1. Sorting problem: We are given a sequence of numbers x1, x2, xn. We scan these numbers from left to right, and put xi to left of xin if xais smaller than xi-1. n other words, we continuously move x to the left until the numbers to its left are all smaller than or equal to it. Design an algorithm to resolve this sorting problem. (20 Marks) 2. Please analyze the time complexity of your above designed algorithm, in terms of both the best case and worst case complexities. (10 Marks)