希尔排序

#include <iostream>
using namespace std;

void shellSort(int a[], int len)
{
  int step = len / 2;

  while (step >= 1) {
    for (int i = step; i < len; i++) {
      int toInsert = a[i];
      int j;
      for (j = i - step; j >= 0 && a[j] > toInsert; j -= step)
	a[j+step] = a[j];
      a[j+step] = toInsert;
    }
    step /= 2;
  }
}

void print(int a[], int len)
{
  for (int i = 0; i < len; i++)
    cout << a[i] << " ";
  cout << endl;
}

int main()
{
  int test[] = {8, 11, 3, 5, 34};
  cout << "before quickSort: " << endl;
  print(test, 5);
  shellSort(test, 5);
  cout << "after quickSort: " << endl;
  print(test, 5);
  return 0;
}