希尔排序-shell sort

希尔排序

• 算法思想: 分组

int data[] = {56, 34, 54, 50, 81, 70, 7, 74, 26, 65, 71, 4, 37, 76, 91, 36};

1. 第一个循环(分组):
   初始值 gap = length / 2, 即 gap = 16 / 2 = 8, 先分为8组进行(目的组内排序)
   
   gap = gap / 2, 直到 gap < 0 结束, 即 gap = 8 --> 4 --> 2 --> 1 --> 0

2. 第二个循环(遍历每个组)
   

3. 第三个循环(组内排序)
   组内排序: 组内相邻的两个进行比较, 从最前面开始
   

#include <stdio.h>

void shell_sort(int *data, int length)
{
	int gap = 0;
	int i = 0, j = 0;
	
	for (gap = length / 2; gap > 0; gap /= 2)
	{
		for (i = gap; i < length; i++)
		{
			for (j = i - gap; j >= 0 && data[j] > data[i]; j = j - gap)
			{
				int temp = data[j];
				data[j] = data[i];
				data[i] = temp;
			}
		}
	}
}

int main(void)
{
	int data[] = {56, 34, 54, 50, 81, 70, 7, 74, 26, 65, 71, 4, 37, 76, 91, 36};
	int length = sizeof(data) / sizeof(data[0]);
	int i;
	
	shell_sort(data, length);
	
	for (i = 0; i < length; i++)
	{
		printf("%4d", data[i]);
	}
	printf("\n");
	
	return 0;
}