快速排序

#include <stdio.h>
#include <stdlib.h>

void Quicksort ( int *a , int left ,int right,int len) {

   if ( left >= right ){
        return ;
   }

   int i,j,k,key;
   key=a[left];
   i=left;
   j=right;

   while ( i < j ) {
        while ( i<j && a[j]>=key ){
                j--;
        }
        a[i]=a[j];

        while ( i<j && a[i]<=key){
                i++;
        }
        a[j]=a[i];
   }
   a[i]=key;

   for (k=0;k<len;k++)
      printf("%d ",a[k]);
      printf("\n");

   Quicksort( a,left,i-1,len);
   Quicksort( a,i+1,right,len);

}




int main(){
    int a[100];
    int n,i;
    scanf("%d",&n);
    for ( i=0;i<n;i++ )
        scanf("%d",&a[i]);

    Quicksort(a,0,n-1,n);
    return 0;
}