Interpolation Search in PHP

<?php
declare(strict_types=1);
// Interpolation Search in PHP
//
// PURPOSE
// Interpolation search estimates the target position from endpoint values, which can help on
// roughly uniform numeric data.
//
// METHOD
// Estimate a position proportional to the target value between endpoint values. Compare
// there and discard the impossible side. Handle equal endpoints separately.
//
// COMPLEXITY
// Expected O(log log n) comparisons for suitable uniform distributions; O(n) worst case,
// O(1) space.
//
// CONTRACT
// Ascending nonnegative integers <= 10000; n <= 10000 so the interpolation product fits
// signed 32-bit. Returns any matching index or -1.
// 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: 2.
// 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 interpolation_search(array $a, int $target): int {
    alg_require(array_is_list($a));
    $n = count($a);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((count($a) == $n));
    alg_require(($n <= 10000));
    for ($alg_i = 0; $alg_i < count($a); $alg_i++) {
        $alg_value = $a[$alg_i];
        alg_require((($alg_value >= 0) && ($alg_value <= 10000)));
    }
    $low = 0;
    $high = alg_sub($n, 1);
    $pos = 0;
    while ((($low <= $high) && ($target >= $a[$low]) && ($target <= $a[$high]))) {
        if (($a[$low] == $a[$high])) {
            return $low;
        }
        $pos = alg_add($low, intdiv(alg_mul(alg_sub($target, $a[$low]), alg_sub($high, $low)), alg_sub($a[$high], $a[$low])));
        if (($a[$pos] == $target)) {
            return $pos;
        }
        if (($a[$pos] < $target)) {
            $low = alg_add($pos, 1);
        } else {
            $high = alg_sub($pos, 1);
        }
    }
    return alg_sub(0, 1);
}

$a = [0, 10, 20, 30];
$target = 20;
$result = interpolation_search($a, $target);
echo $result, PHP_EOL;