C++排序（3）——插入排序

	#include <iostream>
    #include <vector>
    using namespace std;
    
    //插入排序
    //算法时间复杂度 log(n*n)
    //额外空间复杂度 O(1)
    void Insert_Sort(vector <int> &num_s)
    {
        if (num_s.size() == 1)
            return;
        for (int i = 1; i < num_s.size(); i++)
        {
            for (int j = i; j > 0; j--)
            {   
                if (num_s[j - 1] >  num_s[j])
                {
                    int temp = num_s[j - 1];
                    num_s[j - 1] = num_s[j];
                    num_s[j] = 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] << ' ';
        
        Insert_Sort(num_s);
        
        cout << endl << "the Insert_Sort data is" << endl;
        for(int i = 0; i < num_s.size(); i++)
            cout << num_s[i] << ' ';
        system("pause");
        return 0;
    }