快速排序算法

#include <stdio.h>#include <stdlib.h>int a[10000001];void qsort(int l,int r){int ke=a[l];int i=l;int j=r;if(l>r) return;while(i<j){while(i<j && a[j]>=ke) j--;a[i]=a[j];while(i<j && a[i]<=ke) i++;a[j]=a[i];}a[i]=ke;qsort(l,i-1);qsort(i+1,r);}int main(){int n;int i;while(scanf("%d",&n)!=EOF){for(i=0;i<n;i++){scanf("%d",&a[i]);}qsort(0,n-1);for(i=0;i<n;i++){if(i==n-1)printf("%d",a[i]);elseprintf("%d ",a[i]);}printf("\n");}return 0;}