Problem:
Selection Sort

Write a program of the Selection Sort algorithm which sorts a sequence A in ascending order. The algorithm should be based on the following pseudocode:

SelectionSort(A)
1 for i = 0 to A.length-1
2 mini = i
3 for j = i to A.length-1
4 if A[j] < A[mini]
5 mini = j
6 swap A[i] and A[mini]

Note that, indices for array elements are based on 0-origin.

Your program should also print the number of swap operations defined in line 6 of the pseudocode in the case where i ≠ mini.

Input

The first line of the input includes an integer N, the number of elements in the sequence.

In the second line, N elements of the sequence are given separated by space characters.

Output

The output consists of 2 lines.

In the first line, please print the sorted sequence. Two contiguous elements of the sequence should be separated by a space character.

In the second line, please print the number of swap operations.

Constraints

1 ≤ N ≤ 100

Sample Input 1

6
5 6 4 2 1 3

Sample Output 1

1 2 3 4 5 6
4

Sample Input 2

6
5 2 4 6 1 3

Sample Output 2

1 2 3 4 5 6
3

Solution in JAVA (judge verdict: Accepted)

import java.util.Scanner;

class _selectionSort {
	// define variables & initialize
	private static int cnt = 0;	// how many bubbleSort is used
	// Default Constructor
	public _selectionSort() {
	}
	// sort method :: sort given array using insertion Sort
	public static void sort(int[] _A, int _n) {
		for (int i = 0; i <= _n - 1; ++i) {
			int p_min = i;
			for (int j = i; j <= _n - 1; ++j) {
				if (_A[j] < _A[p_min])
					p_min = j;
			}
			if (i != p_min) {
				_A[i] = _A[i] ^ _A[p_min];
				_A[p_min] = _A[i] ^ _A[p_min];
				_A[i] = _A[i] ^ _A[p_min];
				++cnt;
			}
		}
	}
	// print method :: print array
	public static void print(int[] _A) {
		for (int i = 0; i < _A.length; ++i) {
			System.out.print(_A[i]);
			if (i != _A.length - 1)
				System.out.print(" ");
		}
		System.out.println();
	}
	// get method :: get cnt (how many bubbleSort was used)
	public static int get() {
		return cnt;
	}
}

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		////////////////////////////////////
		int n = 0;
		int[] A;

		n = sc.nextInt();
		A = new int[n];
		for (int i = 0; i < n; ++i) {
			A[i] = sc.nextInt();
		}
		_selectionSort.sort(A, n);
		_selectionSort.print(A);
		System.out.println(_selectionSort.get());
		////////////////////////////////////
		sc.close();
	}
}