题解 | #C++选择排序#

#include <iostream>
#include <vector>
using namespace std;

void doInput(vector<int>& v) {
    for (int i = 0; i < v.size(); i++) {
        cin >> v[i];
    }
}

void doSort(vector<int>& v) {
    int len = v.size();
    for (int i = 0; i < len; i++) {
        int min = v[i];
        int index = i;
        for (int j = i + 1; j < len; j++) {
            if (v[j] < min) {
                min = v[j];
                index = j;
            }
        }
        if (index != i) {
            v[index] = v[i];
            v[i] = min;
        }

    }
}

void doPrint(vector<int> v) {
    int len = v.size();
    for (int s : v) {
        cout << s << " ";
    }
    cout << endl;
}
int main() {
    int n = 6;
    vector<int> v = vector<int>(n);
    doInput(v);
    doSort(v);
    doPrint(v);
    return 0;
}