P. 146 Ex. 12.34

// Shavit Borisov
// CW

public class NoDoubles
{
    int[] arr;

    public NoDoubles(int[] arr)
    {
        this.arr = arr.clone();
    }

    public int[] sort()
    {
        int min;
        for(int i = 0; i < arr.length - 1; i++)
        {
            min = searchMin(arr, i);
            if(min != i)
                swap(arr, i, min);
            if(i != 0 && arr[i] == arr[i - 1])
                getRid(i);
        }
        return arr;
    }

    private int searchMin(int[] arr, int i)
    {
        int min = i;
        for(int j = i + 1; j < arr.length; j++)
            if(arr[j] < arr[min])
                min = j;
        return min;
    }

    private void swap(int[] arr, int index, int min)
    {
        int temp = arr[min];
        arr[min] = arr[index];
        arr[index] = temp;
    }

    private void getRid(int index)
    {
        for(int i = index; i < arr.length - 1; i++)
        {
            arr[i] = arr[i + 1];
        }
    }
}