希尔排序是对直接插入排序的优化,数组越有序,插入排序更快
1. 预排序->数组接近有序
2.直接插入排序-> O(N)时间复杂度达到有序
预排序:数组进行分组,比如:间隔为gap的分为一组,分别进行排序,gap==3
//希尔排序(升序)
//平均复杂度:O(N^1.3)
//顺序有序(预排序全部白做了,还不如直接插入排序)情况下复杂度最坏
void ShellSort(int *src, int n)
{
//gap>1时为预排序 接近有序
//gap==1是为直接插入排序 有序
int gap = n;
while (gap > 1)
{
//间隔为gap的预排序
gap = gap / 3 + 1;//加1是保证最后一次一定是1
for (int i = 0; i <n - gap; ++i)
{
int end = i;
int tmp = src[end + gap];
while (end >= 0)
{
if (src[end] > tmp)
{
src[end + gap] = src[end];
end -= gap;//每次减gap
}
else
{
break;
}
src[end + gap] = tmp;
}
}
}
}
代码2.
void ShellSort(int * src, int n)
{
int i, j, k;
int gap, tmp;
for (gap = n / 2; gap; gap /= 2)
{
for (k = 0; k < gap; k++)
{
for (i = gap + k; i < n; i += gap)
{
tmp = src[i];
for (j = i; j >= gap && src[j - gap] > tmp; j -= gap)
{
src[j] = src[j - gap];
}
src[j] = tmp;
}
}
}
}
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include "sort.h"
#define BUFSIZE 10000
void printArray(int * src, int n)
{
int i;
for (i = 0; i < n; i++)
{
printf("%d ", src[i]);
}
putchar('\n');
}
int main()
{
#if 0
int src[10] = { 3, 1, 6, 7, 9, 2, 4, 8, 10, 5 };
ShellSort(src, 10);
printArray(src, 10);
#else
srand(time(NULL));
int src[BUFSIZE];
int i;
for (i = 0; i < BUFSIZE; i++)
{
src[i] = rand() % 5000 + 1;
}
ShellSort(src, BUFSIZE);
printArray(src, BUFSIZE);
#endif
system("pause");
return 0;
}