Unable to climb hill sort, directly insert sort

Sorry for breaking the final exam for so long , From today on, an average of one high-quality article is output every day for everyone to enjoy ！！！

First：

Direct insert sort ：InsertSort

Holistic thinking ： 

Complete code implementation ：

// Direct insert sort 
void InsertSort(int* arr, int len)
{
	for (int i = 0; i < len - 1; i++)
	{
		int end = i;
		int tmp = arr[end + 1];
		while (end >= 0)
		{
			if (tmp < arr[end])
			{
				arr[end + 1] = arr[end];
				--end;
			}
			else
			{
				break;
			}
		}
		arr[end + 1] = tmp;
	}
}
void PrintSort(int* arr, int len)
{
	for (int i = 0; i < len; i++)
	{
		printf("%d ", arr[i]);
	}
}
int main()
{
	int arr[] = { 3,1,2,4,9,5,6};
	int len = sizeof(arr) / sizeof(arr[0]);
	InsertSort(arr, len);	
	PrintSort(arr, len);
}

The following is about how you once ignored him , Now you can't afford Hill sort

Hill sort is an optimization of direct insert sort

Holistic thinking ：

 1、 Pre sort --- Turn data into data that is about to be sorted   

step ： Divide into groups first gap, And then we can sort it

  When gap arrive 1 It's sorted when

Isn't that amazing

Summarize the characteristics of hill sorting ： 

  Complete code implementation ：
 

// Shell Sort 
void ShellSort(int* arr, int len)
{
	int gap = len;
	while (gap > 1)
	{
		gap = gap / 3 + 1;// Make sure the last number is 1
		for (int i = 0; i < len - gap; i++)
		{
			int end = i;
			int tmp = arr[end + gap];
			while (end >= 0)
			{
				if (tmp < arr[end])
				{
					arr[end + gap] = arr[end];
					end -= gap;
				}
				else
				{
					break;
				}
			}
			arr[end + gap] = tmp;
		}
	}
}
void PrintSort(int* arr, int len)
{
	for (int i = 0; i < len; i++)
	{
		printf("%d ", arr[i]);
	}
}
int main()
{
	int arr[] = { 3,1,2,4,9,5,6};
	int len = sizeof(arr) / sizeof(arr[0]);
	ShellSort(arr, len);	
	PrintSort(arr, len);
}

Guys, hurry up and operate the machine ！！！

If there is a mistake , Your advice are most welcome ！