/**
 * Informatik II - FS2009 <br>
 * Uebungsserie 2, Aufgabe 1 <br>
 * SortArray.java <br>
 *
 * SortArray sorts an array of random generated integer numbers
 *
 * @author Philipp Bolliger
 */

import java.util.Random;

public class SortArray {
    //int-Array with 10 elements
    int[] a = new int[10];
    //int[] a = {15,3,4,6,7,8,9,10,11,12};

    /**
     * Initializes an array with uniformly distributed random numbers
     */
    void initialize() {
        Random r = new Random();
        for(int i=0;i<a.length;i++) {
            a[i] = r.nextInt(1000);
        }
    }

    /**
     * Prints the elements of the array a
     */
    void print() {
        for(int i=0;i<a.length;i++) {
            System.out.print(a[i] + " ");
        }
        System.out.println();
    }

    /**
     * Sorts the elements of the array a in descending order
     */
    void sort(int i) {
        int maxIndex=i;
        // find index of biggest element between i+1 and end of array
        for(int j=i+1;j<a.length;j++) {
            if(a[j] > a[maxIndex]) {
                maxIndex = j;
            }
        }
        // switch maxIndex with i
        if (maxIndex != i) {
            int tmp = a[i];
            a[i] = a[maxIndex];
            a[maxIndex] = tmp;
        }
        // continue sorting the rest of the array
        if(i+1<a.length) {
            sort(i+1);
        }
    }

    public static void main(String[] args) {
        // An instance of the class SortArray need to be created
        // to access the methods of this class
        // Methods' calls with s.<methodName>
        SortArray s = new SortArray();

        // Initialise:
        s.initialize();

        System.out.println("Array unsorted:");
        // Output, not sorted:
        s.print();

        // Sort:
        s.sort(0);

        System.out.println("Array sorted:");
        // Output, sorted:
        s.print();
    }
}