Algorithms: Sorting

function comb_sort(array &$a): int {
    alg_require(array_is_list($a));
    $n = count($a);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((count($a) == $n));
    $gap = $n;
    $changed = 1;
    $i = 0;
    $temp = 0;
    while ((($gap > 1) || ($changed != 0))) {
        $gap = max(1, intdiv(alg_mul($gap, 10), 13));
        $changed = 0;

    static int cocktail_sort(int[] a) {
        java.util.Objects.requireNonNull(a, "a");
        int n = a.length;
        alg_require(((n >= 0) && (n <= 1000000)));
        alg_require((a.length == n));
        int low = 0;
        int high = Math.subtractExact(n, 1);
        int i = 0;
        int changed = 1;
        int temp = 0;
        while (((low < high) && (changed != 0))) {
            changed = 0;

function cocktail_sort(a) {
    alg_require(a instanceof Int32Array);
    let n = a.length;
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require((a.length == n));
    let low = 0;
    let high = alg_sub(n, 1);
    let i = 0;
    let changed = 1;
    let temp = 0;
    while (((low < high) && (changed != 0))) {
        changed = 0;

def cocktail_sort(a: list[int]) -> int:
    alg_require(isinstance(a, list) and len(a) <= 1000000)
    n: int = len(a)
    alg_require(n >= 0 and n <= 1000000)
    alg_require(len(a) == n)
    low: int = 0
    high: int = n - 1
    i: int = 0
    changed: int = 1
    temp: int = 0
    while low < high and changed != 0:
        changed = 0

int cocktail_sort(int *a, size_t a_length) {
    int alg_error = 0;
    int alg_result = INT_MIN;
    errno = 0;
    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; }
    int low = 0;