ShellSort算法

#include <iostream>
using namespace std;
void shellsort(int v[],int n)
{
    int gap,i,j,temp;
    for (gap = n/2 ; gap >0 ; gap /= 2)
    {
        for (i = gap; i < n ; ++i)
        {
            for (j = i - gap ; j >=0 && v[j] > v[j+gap] ; j -= gap)
            {
                temp = v[j];
                v[j] = v[j + gap];
                v[j+gap] = temp;
            }
        }
    }
}

void main()
{
    int v[] = {10,32,12,24,55,11,63,84,1,3,76};
    shellsort(v,11);
    for (int i = 0; i <11;i++)
    {
        cout<<v[i]<<"  ";
    }
    cout<<endl;
}