/*
    StickySort.java
    CIS 160
    David Klick
    2015-10-17

    Modified by: <your name should be added>
    <date of modification>
    <brief decription/list of modification(s)>

    This program tests a sorting algorithm.
*/

public class StickySort {
    public static void main(String[] args) {
        // Get a random number generator set up
        // Note: By using full package name, we do not need an import statement.
        java.util.Random rnd = new java.util.Random();

        // Create an array of integers (initially all -1)
        int[] nums = new int[20];
        java.util.Arrays.fill(nums, -1);
        
        // Fill the array with non-duplicated integers from 0 - 99
        int pos = 0;
        while (pos<nums.length) {
            int key = rnd.nextInt(100);
            // This is where duplicates are discarded.
            if (!contains(nums, key)) nums[pos++] = key;
        }
        
        // Verify that the array is unsorted to start with and display it.
        System.out.printf("The original array is %ssorted:%n", isSorted(nums) ? "" : "not ");
        displayArray(nums);
        
        // Sort the array
        /***** Uncomment this sort call once your sort method has been written
        sort(nums);
        *****/
        
        // Verify that the array is now sorted and display it.
        System.out.printf("%nThe result array is %ssorted:%n", isSorted(nums) ? "" : "not ");
        displayArray(nums);
    }
    
    // Given an array and a value, this method returns true if the value
    // is found in the array, and false if it is not found.
    private static boolean contains(int[] ar, int value) {
        int pos = 0;
        while (pos < ar.length && ar[pos] != value) pos++;
        return pos < ar.length;
    }

    // This method displays an integer array with two digits per element.
    private static void displayArray(int[] ar) {
        for (int pos=0; pos<ar.length; pos++) {
            System.out.printf("%02d ", ar[pos]);
        }
        System.out.println();
    }

    // Given an array of integers, this method returns true if the array
    // is sorted in ascending order, and false if it is not in order.
    private static boolean isSorted(int[] ar) {
        int pos = 0;
        while (pos < ar.length-1 && ar[pos] <= ar[pos+1]) pos++;
        return pos == ar.length - 1;
    }
    
    // Given an array of integers, this method sorts the elements
    // of the array into ascending order.
    /***** This is where your sort method must go *****/
}