题解 | #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 temp = arr[0];
    for (int i = 0; i < len - 1; i++)
    {
        for (int j = 0; j < len - i - 1; j++)
            if ( arr[j] > arr[j+1] )//冒泡排序反过来就好了
            {
                temp = arr [j];
                arr[j] = arr[j+1];
                arr[j+1] = temp;
            }
    }
    for (int i = 0; i < len; i++)
    cout<<arr[i]<<" ";

    return 0;
}

这是最后一次

之后必须改正不加大括号的陋习