c语言快速排序完整代码

以下是C语言实现的快速排序的完整代码：

代码实现1：

void QuickSort(int* a, int left, int right) {
    if (left >= right) {
        return;
    }
    int begin = left, end = right;
    int keyi = begin;
    int prev = begin;
    int cur = prev + 1;
    while (cur <= end) {
        if (a[cur] < a[keyi] && ++prev != cur) {
            int temp = a[cur];
            a[cur] = a[prev];
            a[prev] = temp;
        }
        cur++;
    }
    int temp = a[keyi];
    a[keyi] = a[prev];
    a[prev] = temp;
    QuickSort(a, left, prev - 1);
    QuickSort(a, prev + 1, right);
}

代码实现2：

void quicksort(int a[10], int first, int end) {
    if (first > end) {
        return;
    }
    int i = first, j = end, flag = a[i], exchange = 0;
    while (i != j) {
        while (i < j && a[j] > flag) {
            j--;
        }
        while (i < j && a[i] <= flag) {
            i++;
        }
        if (j > i) {
            exchange = a[i];
            a[i] = a[j];
            a[j] = exchange;
        }
    }
    a[first] = a[i];
    a[i] = flag;
    quicksort(a, first, i - 1);
    quicksort(a, i + 1, end);
}