题解 | 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];
    }
    
    for (int i = 0; i < 6; i ++) {
        for (int j = 0; j < 5; j ++) {
            if (arr[j] > arr[j + 1]) {
                int temp;
                temp = arr[j + 1];
                arr[j + 1] = arr[j];
                arr[j] = temp;
            }
        }
    }

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

    return 0;
}