【数据结构】快速排序的实现。

问题描述：利用快速排序对以下数据进行排序1,5,7,8,3,5,9,4,1,0。

代码实现：

main.c

#include <stdio.h>
#define N 10

int partion(int *data, int low, int high);
int quick_sort(int *data, int low, int high);

int main(int argc, const char *argv[]) {

    int i;
    int data[N] = {1, 5, 7, 8, 3, 5, 9, 4, 1, 0};

    for (i = 0; i < N; i++) {
        printf("%d ", data[i]);

    }
    puts("");
    quick_sort(data, 0, N-1);
//    qsort(data, N, sizeof(int), compare);

    for (i = 0; i < N; i++) {
        printf("%d ", data[i]);

    }
    puts("");

    return 0;
}

int partion(int *data, int low, int high) {
    int temp = data[low];
    while (low < high) {
        while (low < high && temp <= data[high]) {
            high--;
        }
        data[low] = data[high];

        while (low < high && temp >= data[low]){
            low++;
        }
        data[high] = data[low];
    }

    data [low] = temp;
    return low;

}

int quick_sort(int *data, int low, int high){
    int t;

    if (data == NULL) {
        return -1;

    }

    if (low > high)
        return 0;

    t = partion(data, low, high);
    quick_sort(data, low, t-1);
    quick_sort(data, t+1, high);

    return 0;

}

运行结果

显示成功排序成功。