冒泡排序

#include <iostream>
using namespace std;
int main() {
    int a[100], tmp = 0;
    for (int i = 0; i < 10; i++)
        cin >> a[i];
    for (int i = 0; i < 10; i++) {
        for (int j = 0; j < 9 - i; j++) {
            if (a[j] > a[j + 1]) {
                tmp = a[j];
                a[j] = a[j + 1];
                a[j + 1] = tmp;
            }
        }
    }
    for (int i = 0; i < 10; i++)
        cout << a[i] << ‘ ‘;
    return 0;
}