快速排序

#include <stdio.h>

void Sort(int array[], int low, int high)
{
	int i, j;
	int index;

	if (low >= high)
	{
		return;
	}

	i = low;
	j = high;
	index = array[i];

	while (i < j)
	{
		while (i < j && array[j] >= index)
		{
			j--;
		}
		if (i < j)
		{
			array[i++] = array[j];
		}
		while (i < j && array[i] < index )
		{
			i++;
		}
		if (i < j)
		{
			array[j--] = array[i];
		}
	}
	array[i] = index;
	Sort(array, low, i - 1);
	Sort(array, i + 1, high);
}

void QuickSort(int array[], int length)
{
	Sort(array, 0, length - 1);
}

int main()
{
	int i = 0;
	int a[] = {29, 96, 18, 56, 3, 56, 39, 77};
	int length = sizeof (a) / sizeof(a[0]);

	QuickSort(a, length);

	for (i = 0; i < length; i++)
	{
		printf("%d ", a[i]);
	}
	printf("\n");
	return 0;
}