P. 139 Ex. 12.25

// Shavit Borisov
// CW

import java.util.Scanner;

public class SameIndex {

    static Scanner in = new Scanner(System.in);

    public static void main(String[] args)
    {
        final int SIZE = 5;
        int[] unsorted = new int[SIZE];
        getIni(unsorted);

        int[] sorted = new int[SIZE];
        sorted = unsorted.clone();

        int min;
        for(int i = 0; i < SIZE - 1; i++)
        {
            min = searchMin(sorted, i);
            if(min != i)
                swap(sorted, i, min);
        }

        int counter = 0;
        for(int i = 0; i < SIZE; i++)
            if(unsorted[i] == sorted[i])
                counter++;

        System.out.printf("%d values were in their right indexes before the sort", counter);
    }

    private static void getIni(int[] arr)
    {
        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();
        }
    }

    private static 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 static void swap(int[] arr, int index, int min)
    {
        int temp = arr[min];
        arr[min] = arr[index];
        arr[index] = temp;
    }
}