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

#include <iostream>
using namespace std;

int main() {

    int arr[6] = { 0 };
    int len = sizeof(arr) / sizeof(int);

    for (int i = 0; i < len; i++) {
        cin >> arr[i];
    }

    // write your code here......
    int min = 0;
    for (int i = 0; i < len - 1; i++) {
        min = i;
        for (int j = i + 1; j < len; j++) {
            min = arr[j] > arr[min] ? min : j;
        }
        swap(arr[min], arr[i]);
    }

    for (int i = 0; i < len; i++) {
        cout << arr[i];

        if (i == len - 1)
            cout << endl;
        else
            cout << " ";
    }

    return 0;
}