编辑代码

#include <stdio.h>
int partition(int arr[],int low,int high){
    int pivot = arr[low],t;
    while(low<high){
        while(low<high&&pivot<arr[high]) high--;
        t=arr[high];arr[high]=arr[low];arr[low]=t;
        while(low<high&&pivot>arr[low]) low++;
        t=arr[high];arr[high]=arr[low];arr[low]=t;
    }
    return low;
}
void QuickSort(int arr[],int low,int high){
    if(low<high){
        int pivot = partition(arr,low,high);
        QuickSort(arr,low,pivot-1);
        QuickSort(arr,pivot+1,high);
    }
}
int main () {
    int arr[] = {39,26,54,83,91,47,18,32};
    QuickSort(arr,0,7);
    for(int i=0;i<8;i++)
        printf("%d,",arr[i]);
	return 0;
}