题解 | C++选择排序

#include <iostream>
using namespace std;

int main() {

    int arr[6] = { 0 };
    int len = sizeof(arr) / sizeof(int);
    int max = 0;
    for (int i = 0; i < len; i++) {
        cin >> arr[i];
    }
    for(int i=0; i<len-1; i++){
        int maxinx = 0;
        for(int j=1; j<len-i; j++){
            maxinx = (arr[maxinx]>arr[j])? maxinx : j;
        }
        int temp = arr[maxinx];
        arr[maxinx] = arr[len-1-i];
        arr[len-i-1] = temp;
    }
    // write your code here......
    for(int i=0; i<len; i++){
        cout <<arr[i]<<" ";
    }

    return 0;
}