【插入排序】直接插入排序

 1 #include <iostream>
 2 #include <vector>
 3 using namespace std;
 4 
 5 void InsertSort(vector<int> &vec)
 6 {
 7     vector<int>::size_type i, j;
 8     int key;
 9     if (vec.size() == 0)
10     {
11         return;
12     }
13 
14     for (i = 1; i < vec.size(); i++)
15     {
16         j = i - 1;
17         key = vec[i];
18         while (j >= 0 && j < i && vec[j] > key)
19         {
20             vec[j + 1] = vec[j];
21             j--;                                //j为unsigned，j--可能为大正数
22         }
23         vec[j + 1] = key;
24     }
25 
26     return;
27 }
28 
29 int main(void)
30 {
31     vector<int> vec;
32     vector<int>::iterator iter;
33     int tmp;
34 
35     while (cin >> tmp)
36     {
37         vec.push_back(tmp);
38     }
39 
40     InsertSort(vec);
41 
42     for (iter = vec.begin(); iter != vec.end(); iter++)
43     {
44         cout << *iter << " ";
45     }
46     cout << endl;
47 
48     return 0;
49 }