快速排序法

#include<stdlib.h>#include<stdio.h>int partion(int a[], int low, int high){    int pivot = a[low];    while (low < high)    {        while (low<high&&a[high]>=pivot) high--;        a[low] = a[high];        while (low < high&&a[low] <=pivot) low++;        a[high] = a[low];    }    a[low] = pivot;    return low;}int quicksort(int a[], int low,int high){    if (low > high)        return -1;    int index=partion(a, low, high);    quicksort(a, low, index - 1);    quicksort(a, index + 1, high);    return 0;}int main(){    int a[10] = { 3, 4, 1, 6, 5, 2, 9, 10, 7, 8 };    int len = sizeof(a) / sizeof(int);    int low = 0;    int high = len - 1;    quicksort(a, low, high);    for (int i = 0; i < len; i++)        printf("%d\t", a[i]);    system("pause");    return 0;}