C++排序（1）——冒泡排序

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

//冒泡排序
//算法时间复杂度 O(n*n)
//额外空间复杂度 O(1)
void Bubble_Sort(vector <int> &num_s)
{
    if (num_s.size() == 1)
        return;
    for (int i = num_s.size() - 1; i > 0; i--)
        for (int j = 0; j < i; j++)
        {   
            if (num_s[j] >  num_s[j+1])
            { 
                int temp = num_s[j];
                num_s[j] = num_s[j+1];
                num_s[j+1] = temp;
            }
        }
}

int main()
{
    int num;
    vector <int> num_s;

    while(cin >> num)
        num_s.push_back(num);
    cout << "the original data is: " << endl;
    for (int i = 0; i < num_s.size(); i++)
        cout << num_s[i] << ' ';

    Bubble_Sort(num_s);
    
    cout << "Bubble_Sort" << endl;
    for(int i = 0; i < num_s.size(); i++)
        cout << num_s[i] << ' ';
    system("pause");
    return 0;
}