遞迴實現快速排序

標籤：style   blog   color   for   io   div   

#include <stdio.h>int a[101], n;void quicksort(int left, int right) {    int i,j,t,temp;    if (left>right)        return;    temp = a[left];    i=left;    j=right;    while(i != j) {        while (a[j]>=temp && i<j)            j--;        while (a[i]<=temp && i<j)            i++;        if (i<j) {            t=a[i];            a[i]=a[j];            a[j]=t;        }    }    a[left]=a[i];    a[i]=temp;    quicksort(left, i-1);    quicksort(i+1, right);}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]);    getchar();    getchar();    return 0;}