快速排序及其优化

https://blog.csdn.net/qq_38289815/article/details/82718428

基本的快速排序代码：

#include <stdio.h>

void swap(int k[], int low, int high)
{
	int temp;

	temp = k[low];
	k[low] = k[high];
	k[high] = temp;
}
int Partition(int k[], int low, int high)
{
	int point;
	point = k[low];

	while( low < high )
	{
		while( low < high && k[high] >= point )//等号是必须有的，不然当数组中出现相同的数值的时候会陷入死循环；此while和下一个while有一个等号就行
		{
			high--;
		}
		swap(k, low, high);
		
		while( low < high && k[low] <= point )
		{
			low++;
		}
		swap(k, low, high);
	}
    

	return low;
}

void QSort(int k[], int low, int high)
{
	int point;

	if( low < high )
	{
		point = Partition(k, low, high);

		QSort(k, low, point-1);

		QSort(k, point+1, high);
	}
}

void QuickSort(int k[], int n)
{
	QSort(k, 0, n-1);
}

int main()
{
	int i, a[10] = {4, 2, 5, 0, 3, 9, 1, 7, 6, 8};

	QuickSort(a, 10);

	printf("排序后的结果是：");
	for( i=0; i < 10; i++ )
	{
		printf("%d", a[i]);
	}
	printf("\n\n");

	return 0;
}