希尔排序

（1） 第一种书写形式

#include <iostream>  

using namespace std;


int a[] = { 70, 30, 40, 10, 80, 20, 90, 100, 75, 60, 45 };


void ShellSort(int a[], int n);
int main()
{
cout << "Before Sort: ";
for (int i = 0; i<11; i++)
cout << a[i] << " ";
cout << endl;
ShellSort(a, 11);
cout << "After Sort: ";
for (int i = 0; i<11; i++)
cout << a[i] << " ";
cout << endl;
system("pause");
}




void ShellSort(int a[], int n)
{
int gap;
int tmp;
for (int gap = 3; gap>0; gap--)
{
for (int i = 0; i < gap; i++)
{
for (int j = i + gap; j < n; j = j + gap)
{
if (a[j - gap]>a[j])
{
tmp = a[j];
int k = j - gap;
while (k >= 0 && a[k]>tmp)
{
a[k + gap] = a[k];
k -= gap;
}
a[k + gap] = tmp;
}
}
}
}
}

（2）第二种书写形式，都写成函数的形式

#include<iostream>

#define length(array) sizeof(array)/sizeof(array[0])   // 求数组的长度

using namespace std;


void ShellSort(int a[], int n);
void Print(int a[], int n);


int main()
{
int a[] = { 70, 30, 40, 10, 80, 20, 90, 100, 75, 60, 45 };
int len = length(a);
cout << "Before Sort: ";
Print(a, len);
cout << endl;
cout << "After Sort: ";
ShellSort(a, len);
Print(a,len);
cout << endl;
system("pause");
}


void Print(int a[], int n)
{
for (int i = 0; i < n; i++)
{
cout << a[i] << " ";
}
}


void ShellSort(int a[], int n)
{
int gap;
for (gap = 3; gap>0; gap--)
{
for (int i = 0; i < gap; i++)
{
for (int j = i + gap; j < n; j = j + gap)
{
if (a[j - gap]>a[j])
{
int tmp = a[j];
int k = j - gap;
while (k >= 0 && a[k]>tmp)
{
a[k + gap] = a[k];
k -= gap;
}
a[k + gap] = tmp;
}
}
}
}


}

（3）第3种形式

//  容易发现，第3种形式的希尔排序与直接插入排序很像，简直就是它的升级版，直接插入排序可以在另外一篇

//  文章中看到，可以对比着学习。本文直接见 ShellSort(int a[], int n)看希尔排序的具体实现部分。

#include<iostream>
#define length(array) sizeof(array)/sizeof(array[0])
using namespace std;


void ShellSort(int a[], int n);
void Print(int a[], int n);


int main()
{
int a[] = { 70, 30, 40, 10, 80, 20, 90, 100, 75, 60, 45 };
int b[] = { 13, 14, 94, 33, 82, 25, 59, 94, 65, 23, 45, 27, 73, 25, 39, 10, };
int lena = length(a);
int lenb = length(b);
cout << "Before Sort: ";
Print(a, lena);
cout << endl;
cout << "After Sort: ";
ShellSort(a, lena);
Print(a,lena);
cout << endl;


cout << "Before Sort: ";
Print(b, lenb);
cout << endl;
cout << "After Sort: ";
ShellSort(b, lenb);
Print(b, lenb);
cout << endl;
system("pause");
}




void ShellSort(int a[], int n)
{
for (int gap = n / 2; gap > 0; gap /= 2)
{
for (int i = gap; i < n; i++)
{
int tmp = a[i];
int j = i;
for (; j > 0 && tmp < a[j - gap]; j -= gap)
a[j] = a[j - gap];
a[j] = tmp;
}
}
}




void Print(int a[], int n)
{
for (int i = 0; i < n; i++)
{
cout << a[i] << " ";
}
}