快速排序

//快速排序
/*
#include<iostream>
using namespace std;

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


void QSort(int a[], int low, int high)
{
	int pivotloc;
	if (low < high)
	{
		pivotloc = Partion(a, low, high);
		QSort(a, low, pivotloc - 1);
		QSort(a, pivotloc + 1, high);
	}
}




int main()
{
	int a[20], i;
	for (i = 1; i < 11; i++)
		cin >> a[i];
	QSort(a, 1, 10);
	for(i = 1; i <= 10; i++)
		cout << a[i] << "  ";
	return 0;
}

*/