Quick sort

PARTITION(A, p, q)⊳A[p. . q]
    x←A[p]       ⊳pivot= A[p]
    i←p
    forj←p+ 1 toq
        do ifA[j] ≤x
            theni←i+ 1
                exchange A[i] ↔A[j]
    exchange A[p] ↔A[i]
    return i

QUICKSORT(A, p, r)
    if p< r
    then q←PARTITION(A, p, r)
    QUICKSORT(A, p, q–1)
    QUICKSORT(A, q+1, r)

C++：

int partition(int *a,int lhs,int rhs) {
    int i = lhs;
    int j = lhs + 1;
    int pivot = a[lhs];
    while (j <= rhs) {
        if (a[j] >= pivot) {
            ++j;
        }
        else {
            ++i;
            int temp = a[i];
            a[i] = a[j];
            a[j] = temp;
            ++j;
        }
    }
    int temp2 = a[i];
    a[i] = pivot;
    a[lhs] = temp2;
    return i;
}



void QuickSort(int *a, int lhs,int rhs) {
    if (lhs >= rhs) {
        return;
    }
    int q = partition(a, lhs, rhs);
    QuickSort(a, lhs, q);
    QuickSort(a, q + 1, rhs);
}

Text：

#include<iostream>

int partition(int *a,int lhs,int rhs) {
    int i = lhs;
    int j = lhs + 1;
    int pivot = a[lhs];
    while (j <= rhs) {
        if (a[j] >= pivot) {
            ++j;
        }
        else {
            ++i;
            int temp = a[i];
            a[i] = a[j];
            a[j] = temp;
            ++j;
        }
    }
    int temp2 = a[i];
    a[i] = pivot;
    a[lhs] = temp2;
    return i;
}



void QuickSort(int *a, int lhs,int rhs) {
    if (lhs >= rhs) {
        return;
    }
    int q = partition(a, lhs, rhs);
    QuickSort(a, lhs, q);
    QuickSort(a, q + 1, rhs);
}

int main() {

    int a[22] = { 9,8,7,6,5,4,3,2,1,0,5,65,435,224,234,84,642,32,13,87,215,21 };
    QuickSort(a, 0, 21);
    for (auto c : a) {
        std::cout << c << " ";
    }
    std::cout << std::endl;
    return 0;
}