冒泡排序

#include<iostream>using namespace std;const static int MAX = 100;int BubbleSort(int a[], int n) {    //1表示未排序，0表示已排序    int flag = 1;    int i = 0;    int sw = 0;    while(flag) {        flag = 0;        for(int j = n-1; j > i; j--) {            if(a[j-1] > a[j]) {                int temp = a[j];                a[j] = a[j-1];                a[j-1] = temp;                flag = 1;                sw++;            }        }        i++;    }    return sw;}int main() {    int n;    int a[MAX] = {0};    cin >> n;    for(int i=0; i<n; i++) cin >> a[i];    BubbleSort(a, n);    for(int i=0; i<n; i++) {        if (i) cout << " ";        cout << a[i];    }    cout << endl;    return 0;}