Aizu - ALDS1_2_BSelection Sort

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

#include <stdio.h>

int main(int argc, const char * argv[]) {
    // insert code here...
    int n,mini,sum=0;
    scanf("%d",&n);
    int a[105];
    for(int i=0;i<n;i++)
        scanf("%d",&a[i]);
    for(int i=0;i<n;i++)
    {
        mini=i;
        for(int j=i+1;j<n;j++)
        {
            if(a[j]<a[mini])
                mini=j;
        }
        if(mini!=i)
        {
            int b;
            b=a[i];
            a[i]=a[mini];
            a[mini]=b;
            sum++;
        }
    }
    for(int i=0;i<n;i++)
    {
        if(i>0)
            printf(" ");
        printf("%d",a[i]);
    }
    printf("\n%d\n",sum);
    return 0;
}