Algorithms: Sorting

int counting_sort(int *a, size_t a_length, int maximum) {
    int alg_error = 0;
    int alg_result = INT_MIN;
    errno = 0;
    int *counts = NULL;
    if (a_length > 1000000 || (a_length && !a)) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    int n = (int)a_length;
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((n >= 0) && (n <= 1000000)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((int)a_length == n))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }

def counting_sort(a: list[int], maximum: int) -> int:
    alg_require(isinstance(a, list) and len(a) <= 1000000)
    alg_require(type(maximum) is int and -2147483648 <= maximum <= 2147483647)
    n: int = len(a)
    alg_require(n >= 0 and n <= 1000000)
    alg_require(len(a) == n)
    alg_require(maximum >= 0 and maximum <= 1000000)
    for value in a:
        alg_require(value >= 0 and value <= maximum)
    counts: list[int] = [0] * alg_size(maximum + 1)
    i: int = 0
    value: int = 0

function counting_sort(a, maximum) {
    alg_require(a instanceof Int32Array);
    alg_require(Number.isInteger(maximum) && maximum >= -2147483648 && maximum <= 2147483647);
    let n = a.length;
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require((a.length == n));
    alg_require(((maximum >= 0) && (maximum <= 1000000)));
    for (let alg_i = 0; alg_i < a.length; alg_i++) {
        let alg_value = a[alg_i];
        alg_require(((alg_value >= 0) && (alg_value <= maximum)));
    }
    let counts = new Int32Array(alg_size(alg_add(maximum, 1)));

    static int counting_sort(int[] a, int maximum) {
        java.util.Objects.requireNonNull(a, "a");
        int n = a.length;
        alg_require(((n >= 0) && (n <= 1000000)));
        alg_require((a.length == n));
        alg_require(((maximum >= 0) && (maximum <= 1000000)));
        for (int alg_i = 0; alg_i < a.length; alg_i++) {
            int alg_value = a[alg_i];
            alg_require(((alg_value >= 0) && (alg_value <= maximum)));
        }
        int[] counts = new int[alg_size(Math.addExact(maximum, 1))];
        int i = 0;

function quick_sort(array &$a): int {
    alg_require(array_is_list($a));
    $n = count($a);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((count($a) == $n));
    $lefts = array_fill(0, alg_size(64), 0);
    $rights = array_fill(0, alg_size(64), 0);
    $top = 0;
    $low = 0;
    $high = alg_sub($n, 1);
    $left = 0;
    $right = 0;