P. 145 Ex. 12.33

// Shavit Borisov
// CW

import java.util.Scanner;

public class SameValues {

    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);

        final int SIZE = 5;
        int[] arr = new int[SIZE];

        System.out.printf("Enter values for your unsorted array:\n");

        for(int i = 0; i < arr.length; i++)
        {
            System.out.printf("arr[%d] = ", i);
            arr[i] = in.nextInt();
        }

        Sorting obj = new Sorting(arr);
        System.out.printf("Your array has %d unique values", obj.sort());

        in.close();
    }
}

// Next class

public class Sorting
{
    int[] arr;

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

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

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