冒泡排序基本模板

冒泡排序

//
// Created by 29273 on 2022-03-16.
//
#include "bits/stdc++.h"

using namespace std;
int a[100];
int n;

void bubbleSort() {
    int flag;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (a[i] > a[j]) {
                swap(a[i], a[j]);
                flag = 1;
            }
        }
        if (!flag) return;
    }
}

int main() {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    bubbleSort();
    for (int i = 1; i <= n; ++i) {
        cout << a[i] << " ";
    }
    return 0;
}