快排

#include<stdio.h>
int QKpass(int a[],int low,int high)
{
	int x=a[low];
	while(low<high)
	{
		while(a[high]>x&&low<high)
		high--;
		if(low<high)
		{
			a[low]=a[high];
			low++;
		}
		while(a[low]<x&&low<high)
		low++;
		if(low<high)
		{
			a[high]=a[low];
			high--;
		}
	}
	a[low]=x;
	return low;
}
void QKsort(int a[],int low,int high)
{
	if(low<high)
	{
		int pos=QKpass(a,low,high);
		QKsort(a,low,pos-1);
		QKsort(a,pos+1,high);
	}
}
int main()
{
	int a[200];
	int n;
	scanf("%d",&n);
	int i;
	for(i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
	}
	QKsort(a,0,n-1);
	for(i=0;i<n;i++)
	printf("%d ",a[i]);
	return 0;
}