import java.util.*;

public class SmallestInFront {

    public static void main (String[] argv)
    {
        int[] testData = makeRandomArray (10);
        
        System.out.println ("Before: " + Arrays.toString(testData));
        
	smallestInFront (testData);

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


    static void smallestInFront (int[] A)
    {
        // Start by assuming first is smallest.
	int smallest = A[0];

        // We're going to record the position where the smallest occurs.
        int pos = 0;

        // Check against A[1], A[2] ... etc.
	for (int i=1; i<A.length; i++) {
	    if (A[i] < smallest) {
		smallest = A[i];
                pos = i;
	    }
	}

        // Swap with what's in front.
        int temp = A[0];
        A[0] = A[pos];
        A[pos] = temp;
    }


    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;
    }

}