插入排序，希尔排序

#include <stdio.h>
#include <stdlib.h>
#include<assert.h>
#include<time.h>

//count用来记录次数
int  count1 = 0;
int count2 = 0;
int count3 = 0;


void Show(int *arr,int len)
{
	for (int i = 0; i < len; i++)
	{
		printf("%d ",arr[i]);
	}
	printf("\n");
}

void Swap(int *x,int *y)
{
	int temp=0;
	temp = *x;
	*x = *y;
	*y = temp;
}
插入排序基本思想：从第2个值开始，依次往左边找到合适位置插入，插入比自己小的位置之后
//插入排序 从左往右找

void InsertSort(int *arr, int len)
{
	if (arr == NULL)return;
	int i, j, k;
	for (i = 1; i < len;i++)
	{
		int tmp = arr[i];
		for (j = 0; j < i; j++)
		{
			count1++;
			if (tmp < arr[j])
			{
				break;
			}
		}
		for (k = i - 1; k >=j; k--)
		{
			count1++;
			arr[k+1] = arr[k]; 
		}
		arr[j] = tmp;
	}
}
//插入排序 从右往左找
void InsertSortEx(int *arr, int len)
{
	int j;
	if (arr == NULL)return;
	for (int i = 1; i < len; i++)
	{
		int temp = arr[i];
		for ( j= i-1; j >= 0; j--)
		{
			count2++;
			if (temp < arr[j])
			{
				arr[j+1]=arr[j];
			}
			else
			{
				break;
			}
		}
		arr[j+1] = temp;
	}
}
希尔排序基本思想：插入排序的改进，先将整个待排序的记录序列分割成为若干子序列分别进行直接插入排序，待整个序列中的记录“基本有序”时，再对全体记录进行依次直接插入排序；gap = n/2

void Shell(int* arr, int len, int gap)
{
	int j;
	for (int i = gap; i < len; i+=1)
	{
		int tmp = arr[i];
		for (j = i - gap; j >= 0; j-=gap)
		{
			count3++;
			if (tmp < arr[j])
			{
				arr[j+gap] = arr[j];
			}
			else
			{
				break;
			}
		}
		arr[j+gap] = tmp;
	}
	//InsertSortEx(arr,len);
}
void ShellSort(int *arr, int len)
{
	int gap[] = {5,3,1};
	int n = sizeof(arr) / sizeof(arr[0]);
	for (int i = 0; i < n; i++)
	{
		Shell(arr, len, gap[i]);
	}
}
int main()
{
	int arr1[] = {11,3,15,10,7,2,44,1,0};
	int n1 = sizeof(arr1) / sizeof(sizeof(arr1[0]));

	printf("直接插入排序(从左到右找)：\n");
	InsertSort(arr1,n1);
	Show(arr1, n1);
	printf("执行次数：%d\n",count1);

	int arr2[] = { 11, 3, 15, 10, 7, 2, 44, 1, 0 };
	int n2 = sizeof(arr2) / sizeof(sizeof(arr2[0]));

	printf("直接插入排序(从右往左)：\n");
	InsertSortEx(arr2, n2);
	Show(arr2, n2);
	printf("执行次数：%d\n", count2);


	int arr3[] = { 11, 3, 15, 10, 7, 2, 44, 1, 0 };
	int n3 = sizeof(arr3) / sizeof(sizeof(arr3[0]));

	printf("希尔排序：\n");
	ShellSort(arr3,n3);
	Show(arr3, n3);
	printf("循环次数：%d\n", count3);

	return 0;

}

执行结果：

时间复杂度：