We are given a sequence of numbers x ₁ , x ₂ , ..., x _n . We scan these numbers from left to right, and put x_i to left of x _i - 1 if x _i is smaller than x _i - 1. In other words, we continuously move x _i 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.

Answer rating: 100% (QA)

C CODE include using namespace std ... View the full answer