|冒泡排序| 经典基础排序解析

#include <iostream>
#include <vector>
using namespace std;
vector<int> bubbleSort(vector<int>& a, int m) {
    int n = a.size();
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n - i - 1; ++j) {
            if (a[j] > a[j + 1]) {
                swap(a[j], a[j + 1]);
            }
        }
    }
    return a;
}
int main() {
    int n, m;
    cin >> n >> m;
    vector<int> A(n);
    for (int i = 0; i < n; ++i) {
        cin >> A[i];
    }
    vector<int> result = bubbleSort(A, m);
    for (int i = 0; i < n; ++i) {
        if (i > 0) {
            cout << " ";
        }
        cout << result[i];
    }
    cout << endl;
    return 0;
}