import java.util.*;

public class InsertionSort1 {

    public static void main (String[] argv)
    {
        int[] testData = {51, 24, 63, 73, 42, 85, 71, 41, 87, 32};
        
        System.out.println ("Before: " + Arrays.toString(testData));
        
	int[] sortedData = insertionSort (testData);

        System.out.println ("After: " + Arrays.toString(sortedData));
    }

    static int[] insertionSort (int[] A)
    {
        int[] B = new int [A.length];

	for (int i=0; i<A.length; i++) {

            // Find the right place for A[i] in array B.
            int posInB = i;
            for (int j=0; j<i; j++) {
                if (B[j] < A[i]) {
                    // Skip.
                }
                else {
                    posInB = j;
                    break;
                }
            }

            // Now shift rightwards in B from posInB onwards.
            for (int j=i+1; j>posInB; j--) {
                // We need this because the array has to be shifted except
                // for the last position when i=n-1.
                if (j < B.length) {
                    B[j] = B[j-1];
                }
            }
            
            // Assign A[i] in right place.
            B[posInB] = A[i];
	}

        return B;
    }
    
    static int[] makeRandomArray (int length)
    {
        int[] A = new int [length];

	for (int i=0; i<A.length; i++) {
	    A[i] = UniformRandom.uniform (1, 100);
	}

        return A;
    }

}