选择排序

#include<iostream>
using namespace std;
void print(int a[], int n, int i){
    cout << "第" << i + 1 << "遍：";
    for (int j = 0; j < n; j++){
        cout << a[j] << " ";
    }
    cout << endl;
}

int SelectMinKey(int a[], int n, int i){
    int k = i;
    for (int j = i + 1; j < n; j++){
        if (a[k] > a[j])
            k = j;
    }
    return k;
}

void selectSort(int a[], int n){
    int key, tmp;
    for (int i = 0; i < n; i++){
        //最小的元素的下标
        key = SelectMinKey(a, n, i);
        if (key != i){
            //交换
            tmp = a[i];
            a[i] = a[key];
            a[key] = tmp;
        }
        print(a, n, i);
    }
}


int main(){
    int a[8] = {3,1,5,7,2,4,9,6};
    cout << "初始值：";
    for (int j = 0; j < 8; j++){
        cout << a[j] << " ";
    }
    cout << endl << endl;
    selectSort(a, 8);
    return 0;
}