选择排序

/**
 * 排序算法之选择排序
**/
#include <iostream>
#include <vector>
using namespace std;

void sortXuanZe(vector<int>& vec, int n) {
    for (int i = 0; i < n - 1; ++i) {
        int index = i;
        for (int j = i + 1; j < n; ++j) {//寻找最小值，index代表的值为最小
            if (vec[j] < vec[index]) {
                index = j;
            }
        }
        if (index != i) {//交换最小值与已排序的下一值
            int temp = vec[index];
            vec[index] = vec[i];
            vec[i] = temp;
        }
    }
}

int main() {
    vector<int> vec = {2,1,3,5,4};
    int len = vec.size();
    sortXuanZe(vec, len);
    for (int i = 0; i < len; ++i) {
        cout << vec[i] << endl;
    }
    return 0;
}