快速排序

int QuickSort(int a[], int low, int high)
{
	int temp = a[low];
	while(low <high)
	{
		while(low<high && a[low] < temp)
		{
			low++;
		}
		temp = a[low];
		while(low<high && a[high] > temp)
		{
			high--;
		}
		temp = a[high];
	}
	return low;
}

int DivideSort(int a[] , int low, int high)
{
	if(low <high)
	{
		int index = QuickSort(a, low, high);
		DivideSort(a, low, index-1);
		DivideSort(a, index+1, high);
	}
}