Cocktail Sort in PHP

<?php
declare(strict_types=1);
// Cocktail Sort in PHP
//
// PURPOSE
// Cocktail sort is a comparison-sort variant useful for understanding alternative ways to
// move misplaced values.
//
// METHOD
// Alternate forward and backward adjacent-swap passes, shrinking both ends and stopping when
// no swaps occur.
//
// COMPLEXITY
// O(n squared) worst-case time and O(1) auxiliary space. Stable.
//
// CONTRACT
// Sorts ascending in place and returns 0. Intended for small collections; use a general-
// purpose O(n log n) sort for large workloads.
// Public APIs infer array lengths except in C, which accepts pointer/length pairs. Vertex
// counts and matrix dimensions remain explicit. Arrays must contain signed 32-bit integers.
// Sorted order, correct tree topology, and caller-owned data-structure invariants are
// preconditions; checking them on every query would change query complexity.
// Scalar and shape checks are included. Value-range checks are included where needed to
// prevent invalid indexing or nontermination. Allocation sizes are capped at 4,000,000
// workspace entries. Arithmetic outside Python raises an error on 32-bit overflow; Python
// uses arbitrary precision. Native allocation failures propagate. In-place outputs may be
// partly updated after arithmetic failure. These are single-threaded, in-memory
// implementations.
//
// LANGUAGE DETAILS
// PHP 8.1+ on a 64-bit runtime: packed arrays, strict scalar types, read-only inputs by
// value using copy-on-write, references only for outputs, and checked 32-bit arithmetic.
// Invalid input and overflow throw exceptions. PHP arrays have higher overhead than native
// packed buffers in C/Java.
//
// EXAMPLE
// Expected return: 0.
// Expected a after call: [1, 1, 3, 4].
// Run: php example.php
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

function alg_require(bool $valid): void { if (!$valid) throw new InvalidArgumentException("invalid algorithm input"); }
function alg_checked(int|float $v): int { if ($v < -2147483648 || $v > 2147483647 || floor($v) != $v) throw new OverflowException("32-bit result overflow"); return (int)$v; }
function alg_add(int $a,int $b): int { return alg_checked($a+$b); }
function alg_sub(int $a,int $b): int { return alg_checked($a-$b); }
function alg_mul(int $a,int $b): int { return alg_checked($a*$b); }
function alg_size(int $n): int { alg_require($n>=0 && $n<=4000000); return $n; }

function cocktail_sort(array &$a): int {
    alg_require(array_is_list($a));
    $n = count($a);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((count($a) == $n));
    $low = 0;
    $high = alg_sub($n, 1);
    $i = 0;
    $changed = 1;
    $temp = 0;
    while ((($low < $high) && ($changed != 0))) {
        $changed = 0;
        $i = $low;
        while (($i < $high)) {
            if (($a[$i] > $a[alg_add($i, 1)])) {
                $temp = $a[$i];
                $a[$i] = $a[alg_add($i, 1)];
                $a[alg_add($i, 1)] = $temp;
                $changed = 1;
            }
            $i = alg_add($i, 1);
        }
        $high = alg_sub($high, 1);
        $i = $high;
        while (($i > $low)) {
            if (($a[alg_sub($i, 1)] > $a[$i])) {
                $temp = $a[$i];
                $a[$i] = $a[alg_sub($i, 1)];
                $a[alg_sub($i, 1)] = $temp;
                $changed = 1;
            }
            $i = alg_sub($i, 1);
        }
        $low = alg_add($low, 1);
    }
    return 0;
}

$a = [4, 1, 3, 1];
$result = cocktail_sort($a);
echo $result, PHP_EOL;
// Expected a: [1, 1, 3, 4]
echo json_encode($a), PHP_EOL;