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;
public class Main{
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);

		int n = scan.nextInt();
		int count = 0;
		int[] A = new int[n];

		for(int i=0;i<n;i++) {
			A[i]=scan.nextInt();
		}

		for(int i = 0; i<n;i++) {
			int min = i;
			for(int j=i;j<n;j++) {
				if(A[j]<A[min]) {
					min = j;
				}
			}
			if(min!=i) {
				int temp = A[i];
				A[i] = A[min];
				A[min] = temp;
				count++;
			}

		}
		for(int i = 0; i < n; i++) {
			if(i==0) {
				System.out.print(A[i]);
			}
			else {
				System.out.print(" " + A[i]);
			}
		}
		System.out.println();
		System.out.println(count);
		scan.close();
	}
}