快速排序法.txt

#include<stdio.h>
void quicksort(int a[],int low,int high);
int split(int a[],int low,int high);
int main(){
int a[10000],n,i;
scanf("%d\n",&n);
for(i=0;i<n;i++){
    scanf("%d",&a[i]);}
quicksort(a,0,n-1);
for(i=0;i<n;i++){
        if(i!=(n-1))
    printf("%d ",a[i]);
else printf("%d",a[i]);}}
void quicksort(int a[],int low,int high){
int middle;
if(low>=high)
    return;
    middle=split(a,low,high);
    quicksort(a,low,middle-1);
    quicksort(a,middle+1,high);
}
int split(int a[],int low,int high){
int t=a[low];
for(;;){
while(low<high&&t<=a[high])
    high--;
if(low>=high)break;
a[low++]=a[high];
while(low<high&&a[low]<=t)
    low++;