快速排序算法

#include<stdio.h>#include<stdlib.h>void putfun(int a[]){    int i;    static int j=0;    printf("%d: ",j++);    for(i=0;i<10;i++)        printf("%5d",a[i]);    printf("\n\n");}void sort(int a[],int start,int end){    int i=start,j=end,m,t;    m=a[start];    if(start>=end) return;    while(j>i)    {        if(a[i]>a[j])        {t=a[i];a[i]=a[j];a[j]=t;}        if(m==a[j]) i++;        else j--;    }    putfun(a);    sort(a,start,j-1);    sort(a,j+1,end);}int main(){    int a[]={57,68,52,85,72,38,96,33,24,19};    putfun(a);    sort(a,0,9);    return 0;}