冒泡排序

冒泡排序

/**
 * 冒泡排序
**/
#include <iostream>
#include <vector>
using namespace std;

vector<int> sortMaoPao (vector<int> vec) {

    if (vec.empty()) return vec;

    int len = vec.size();
    for (int i = 0; i < len; ++i) {
        for (int j = 0; j < len - i - 1; ++ j) {
            if (vec[j] > vec[j + 1]) {
                int temp = vec[j];
                vec[j] = vec[j + 1];
                vec[j + 1] = temp;
            }
        }
    }
    return vec;
}

int main() {
    vector<int> vec = {3,2,1,5,4};
    vector<int> res = sortMaoPao(vec);
    for (int i = 0; i < res.size(); ++i) {
        cout << res[i] << endl;
    }
    return 0;
}