1 #include<iostream>
 2 #include<vector>
 3 
 4 using namespace std;
 5 
 6 //谢尔排序（缩减增量排序）
 7 template<typename Comparable>
 8 void shellsort(vector<Comparable> &a)
 9 {
10     for (int gap = a.size() / 2;gap > 0;gap /= 2)
11     {
12         for (int i = gap;i < a.size();i++)
13         {
14             Comparable tmp = a[i];
15             int j = i;
16 
17             for (;j >= gap&&tmp < a[j - gap];j -= gap)
18             {
19                 a[j] = a[j - gap];
20             }
21             a[j] = tmp;
22         }
23     }
24 }
25 
26 int main()
27 {
28     vector<int> a = { 3,4,5,8,7,1 };
29     shellrtsort(a);
30     for (auto c : a)
31     {
32         cout << c<<endl;
33     }
34     system("pause");
35 }