快排模板

/*快排*/
#include<stdio.h>
#include<stdlib.h>
#define MAX 1001
int a[MAX];
void qsort(int l,int r){
	int i,j,k,m;
  	i=l; j=r; m=a[(i+j)/2];
  	do{
    	while (a[i]<m) i++;
    	while (a[j]>m) j--;
    	if (i<=j){
      		k=a[i]; a[i]=a[j]; a[j]=k;
      		i++; j--;
    	}
  	}while (i<=j);
  	if (l<j) qsort(l,j);
  	if (i<r) qsort(i,r);
}
int main(){
  	int n,i,j; 
  	scanf("%d",&n);
  	for (i=1;i<=n;i++)
    	scanf("%d",&a[i]);
  	qsort(1,n);
  	for (i=1;i<=n;i++)
    	printf("%d ",a[i]);
  	puts(""); system("pause>nul");
  	return 0;
}