end--；
x = a[end + 1];

for(i = 0; i < n - 1; i++)
{
    
}

//插入排序
void InsetSort(int* a, int n)
{
	int end = 0;
	int i = 0;

	for (i = 0; i < n - 1; i++)
	{
		end = i;
		int x = a[end + 1];

		while (end >= 0)
		{
			if (a[end] > x)
			{
				a[end + 1] = a[end];
				a[end] = x;
				
			}
			else
			{
				break;
			}
			end--;
		}
	}
	
}

int main()
{
	int a[4] = { 2, 6, 5, 3 };
	InsetSort(a, 4);
	//ShellSort(a, 4);

	int i = 0;
	for (i = 0; i < 4; i++)
	{
		printf("%d ", a[i]);

	}
	printf("\n");

	return 0;
}

//希爾排序
void ShellSort(int* a, int n)
{
	int end = 0;
	int i = 0;
	int j = 0;
	int gap = 6;

	//預(yù)排序
	for (j = 0; j < gap; j++)
	{
		//最后一個(gè)數(shù)一定是1
		gap = gap / 2;
		for (i = 0; i < n - gap; i++)
		{
			end = i;
            //這里其實(shí)就是直接插入排序，而數(shù)組的每個(gè)元素間隔是gap
			int x = a[end + gap];

			while (end >= 0)
			{
				if (a[end] > x)
				{
					a[end + gap] = a[end];
					a[end] = x;

				}
				else
				{
					break;
				}
				end -= gap;
			}
		}

	}
}

//性能測(cè)試
void TestOP()
{
	srand(time(0));
    //以1000個(gè)數(shù)字為例
	const int N = 10000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);

	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		a2[i] = a1[i];
	}
    //這里clock是運(yùn)行到這里的時(shí)間
	int begin1 = clock();
	InsertSort(a1, N);
	int end1 = clock();

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();
    //end-begin為排序所用時(shí)間
	printf("%d\n%d\n", end1 - begin1, end2 - begin2);
}