选择排序

#include<iostream>
using namespace std;
const static int MAX = 100;

int selectSort(int a[], int n) {
    int sw = 0;
    for(int i=0; i < n; i++) {
        int min = a[i];
        int minj = i;
        for(int j = i; j<n; j++) {
            if(min > a[j]) {
                min = a[j];
                minj = j;
            }
        }
        if(minj != i){
            int temp = a[minj];
            a[minj] =  a[i];
            a[i] = temp;
            sw++;
        }
    }
    return sw;
}

int main() {
    int n;
    int a[MAX] = {0};
    cin >> n;
    for(int i=0; i<n; i++) cin >> a[i];
    int s = selectSort(a, n);

    for(int i=0; i<n; i++) {
        if (i) cout << " ";
        cout << a[i];
    }
    cout << endl;
    cout << s << endl;

    return 0;
}