C 排序代码

#include
#define N 10
void quicksort(int a[],int low,int high);
int split(int a[],int low,int high);
int main(void)
{
    int a[N],i;
    printf("Enter %d numbers to be sorted : ",N);
    for(i=0;i=high) 
        return;
    middle = split(a,low,high);
    quicksort(a,low,middle-1);
    quicksort(a,middle+1,high);
}
int split(int a[],int low,int high)
{
    int part_element = a[low];
        for(;;){ 
            while (low < high &&part_element <= a[high])
                high --;
            if(low>=high) break;
            a[low++]=a[high];

            while (low < high && a[low] <= part_element)
                low ++;
          壯陽藥
  if(low >= high) break;
            a[high] = a[low];
        }
    a[high] = part_element; 
    return high;
    

}