C++ 代码
#include <iostream>
using namespace std;
const int M = 1e6 + 10;
int A[M];
int bubblesort(int A[], int N) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = N - 1; j >= i + 1; j--) {
if (A[j - 1] > A[j]) {
swap(A[j - 1], A[j]);
flag = 1;
sw++;
}
}
}
return sw;
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
int sw = bubblesort(A, N);
for (int i = 0; i < N; i++)
cout << A[i] << " ";
cout << endl;
return 0;
}