冒泡排序

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

// 冒泡排序
class BubbleSort
{
public:
    void SortF(vector<int>& vec)
    {
        for (int j = 0; j < vec.size()-1; ++j) // n-1次
        {
            for(int i = 1; i < vec.size(); ++i) // n-1次
            {
                if(vec[i-1] > vec[i])
                {
                    std::swap(vec[i-1], vec[i]);
                }
            }
        }
    }

    void SortW(vector<int>& vec)
    {
        bool is_sorted = false;
        auto n = vec.size();

        while(!is_sorted)
        {
            is_sorted = true;

            for (int i = 1; i < n; ++i)
            {
                if(vec[i-1] > vec[i])
                {
                    std::swap(vec[i-1], vec[i]);
                    is_sorted = false;
                }
            }
            --n;
        }
    }
};

void Print(const vector<int>& vec)
{
    for(auto entry : vec)
    {
        cout << entry << " ";
    }

    cout << endl;
}

int main()
{
    BubbleSort bs;

    vector<int> vec = {5,2,7,4,6,3,1};
    bs.SortF(vec);
    Print(vec);

    vector<int> vec_1 = {5,2,7,4,6,3,1};
    bs.SortW(vec_1);
    Print(vec_1);

    return 0;
}