#include<stdlib.h>
#include<stdio.h>
using namespace std;
void Shell_Sort(int* arry, int count)
{
int i = 0;
int j = 0;
int k = -1;
int tmp = -1;
int gap = count;
do
{
gap = gap / 3 + 1;
for ( i = gap; i < count; i+=gap)
{
k = i;
tmp = arry[k];
for (j=i-gap; i >=0&&arry[j]>tmp; j-=gap)
{
arry[j + gap] = arry[j];
k = j;
}
arry[k] = tmp;
}
} while (gap>1);
}
void main()
{
int arry[] = { 12,20,45,25,35,1,2,54,52 };
int count = sizeof(arry) / sizeof(*arry);
printf("arry數組個數:%d\n", count);
for (int i = 0; i < count; i++)
{
printf("%d ", arry[i]);
}
printf("\n排序之前");
Shell_Sort(arry, count);
for (int i = 0; i < count; i++)
{
printf("%d ", arry[i]);
}
printf("\n排序之後");
system("pause");
}
排序算法-希爾排序
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.