希尔排序

#include<stdio.h>
#include<stdlib.h>
void ShellSort(int*array,int length) {
	int increment = length;
	while (increment>1)
	{
		increment = increment / 2;//不断变化的增量，到一为止
		for (int i = 0; i < length-increment; i++)//画图即知
		{
			int index = i;//起点
			int temp = array[index + increment];//挂起后面的值（起点+增量）
			while (index>=0)//表明前后都影响
			{
				if (array[index+increment]<array[index])
				{
					array[index + increment] = array[index];
					index -= increment;//不断往后退，比较前面的数
				}
				else
				{
					break;
				}
			}
			array[index + increment] = temp;//会走到这一步说明index已经为负数，不需要在往前走了，则为负数之前的值即是该填入的位置
		}
	}
}

void printArray(int* array, int size) {
	for (int i = 0; i < size; i++)
	{
		printf("%d ", array[i]);
	}
}

int main()
{
	int arr[10] = { 8,5,4,2,9,1,0,3,7,6 };
	printf("排列前：");
	for (int i = 0; i < 10; i++)
	{
		printf("%d  ", arr[i]);
	}
	printf("\n\n");	
	ShellSort(arr, 10);
	printf("排列后：");
	for (int i = 0; i < 10; i++)
	{
		printf("%d  ", arr[i]);
	}
	printf("\n\n");
	return 0;
}

参考： 

希尔排序----附图解（C语言）_希尔排序c语言-CSDN博客https://blog.csdn.net/m0_64681789/article/details/127034339?ops_request_misc=&request_id=&biz_id=102&utm_term=%E5%B8%8C%E5%B0%94%E6%8E%92%E5%BA%8Fc&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduweb~default-3-127034339.142^v99^pc_search_result_base6&spm=1018.2226.3001.4187