希尔排序实现

刚刚看了希尔排序的方法，然后就着书上的例程写了这个C++版的实现，目的是理解并消化这个排序的方法和思想

#include <iostream>
#include <vector>
using namespace std;
void shellsort(vector<int> &a)
{
int j;
for(int increment=a.size()/2;increment>0;increment/=2)
for(int i=increment;i<a.size();i++)
{
int tmp=a[i];
for(j=i;j>=increment&&tmp<a[j-increment];j-=increment)
a[j]=a[j-increment];
a[j]=tmp;
}
};
int main()
{
vector<int> ivec;
ivec.push_back(81);
ivec.push_back(94);
ivec.push_back(11);
ivec.push_back(96);
ivec.push_back(12);
ivec.push_back(35);
ivec.push_back(17);
ivec.push_back(95);
ivec.push_back(28);
ivec.push_back(58);
ivec.push_back(41);
ivec.push_back(75);
ivec.push_back(15);
shellsort(ivec);
for(int i=0;i<ivec.size();i++)
cout<<ivec[i]<<endl;
return 0;
}