import java.util.Scanner;

class Oct13 {
	public static void main(String[] args) {

		Scanner kb = new Scanner(System.in);

		double[] arr = {5,4,3,2};

		printArray(arr);		

		selectionSort(arr);

		printArray(arr);		

		double[] arr1 = {2,7,1,9,4,3,7,10,-3};

		selectionSort(arr1);

		printArray(arr1);		

		printIntegers(1,2);
		printIntegers(1,2,3,4);

	}

	static void selectionSort(double[] list) {

		// pseudo-code
		// iterate over the elements in list up to len-1
		for(int i = 0; i < list.length - 1; i++) {

			//initialize curMin and curMinIndex
			double curMin = list[i];
			int curMinIndex = i;

			// find min in portion of array to the right of i
			for(int j = i + 1; j < list.length; j++) {
				// if we find an element smaller than curMin
				// change curMin and curMinInded
				if(list[j] < curMin) {
					curMin = list[j];
					curMinIndex = j;
				}
			}

			//If curMin changed, swap
			if (curMinIndex != i) {
				list[curMinIndex] = list[i];
				list[i] = curMin;
			}
		}

	}

	static void printArray(double[] arr) {
		for(double elm : arr) {
			System.out.print(elm + " ");
		}
		System.out.println();
	}

	static void printIntegers(double ... arr) {
		printArray(arr);
	} 


}

// end of file