快速排序

#include <stdio.h>

#define N  60
void kuaipai(int a[],int left,int right)
{
    int i = left;
    int j = right;
    int temp = a[left];
    if(left>=right)
    {
        return;
    }
    while(i!=j)
    {
        while(i<j&&a[j]>=temp)
        {
         j--;
        }
        if(i<j)
        {
            a[i] = a[j];
        }
        while(i<j&&a[i]<=temp)
        {
            i++;
        }
        if(i<j)
        {
           a[j] = a[i];
        }
    }
    a[i] = temp;
    kuaipai(a,left,i-1);
    kuaipai(a,i+1,right);
}

int main()
{   int n,i;
    int a[N];
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    kuaipai(a,0,n);
    for(i=0;i<n;i++)
    {
        printf("%d\t",a[i]);
    }
    return 0;
}