快速排序的C语言实现（严蔚敏教材版）

#include

#define Elemtype int

//一趟划分
int Partition(Elemtype Array[], int low, int high){
    Elemtype pivot = Array[low]; //将当前表中第一个元素设为枢纽，对表进行划分
    while(low < high) {
        while(low < high && Array[high] >= pivot) --high; //高位指针往左移
        Array[low] = Array[high]; //将比枢纽元素小的元素移动到左端
        while(low < high && Array[low] <= pivot) ++low; //低位指针右移
        Array[high] = Array[low]; //将比枢纽元素大的元素移动到右端
    }
    Array[high] = pivot; // 枢纽元素的位置确定了
    return high;
}


void QuickSort(Elemtype Array[], int low, int high){
    if(low < high) {
        int pivotpos = Partition(Array, low, high);
        QuickSort(Array, low, pivotpos - 1);
        QuickSort(Array, pivotpos + 1, high);
    }
}

int main(){
    int Array[10] = {1, 43, 456, 654, 456, 3, 7, 49, 325, 32};
    QuickSort(Array, 0, 9);
    for (int i = 0; i < 10; i++){
        printf("%d, ", Array[i]);
    }
    printf("n");
    return 0;
}