快速排序

#include <stdio.h>void quicksort(int left,int right); int a[100],n;int main(){    int i;    scanf("%d",&n);    for(i = 1;i <= n;i++)        scanf("%d",&a[i]);    quicksort(1,n);    for(i = 1;i <= n;i++)        printf("%d ",a[i]);    return 0;}void quicksort(int left,int right){    int term,t,i,j;    if(left > right)        return;    term = a[left];    i = left;    j = right;    while(i != j)    {        while(a[j] >= term && j > i)            j--;        while(a[i] <= term && j > i)            i++;        if(i < j)        {t = a[i];a[i] = a[j];a[j] = t;}    }    a[left] = a[i];    a[i] = term;    quicksort(left,i-1);    quicksort(i+1,right);    return;}