The input is a permutation of a set of n numbers in an array A[1..n] with the permutation specified. Design an (nlog n) algorithm to order the numbers in A according to the permutation (1,2,3,...,n) without using more than constant additional space.

For example, if A = {10.5,9.3,2.7,13.6} and = {4,2,3,1}, then the output should be A = {13.6,9.3,2.7,10.5}.