Algorithms: Array Techniques

int maximum_subarray(const 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; }
    if (!((n >= 1))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }

def maximum_subarray(a: list[int]) -> int:
    alg_require(isinstance(a, (list, tuple)) and len(a) <= 1000000)
    n: int = len(a)
    alg_require(n >= 0 and n <= 1000000)
    alg_require(len(a) == n)
    alg_require(n >= 1)
    ending: int = a[0]
    best: int = a[0]
    i: int = 1
    while i < n:
        ending = max(a[i], ending + a[i])
        best = max(best, ending)

function maximum_subarray(a) {
    alg_require(a instanceof Int32Array);
    let n = a.length;
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require((a.length == n));
    alg_require((n >= 1));
    let ending = a[0];
    let best = a[0];
    let i = 1;
    while ((i < n)) {
        ending = Math.max(a[i], alg_add(ending, a[i]));
        best = Math.max(best, ending);

    static int maximum_subarray(int[] a) {
        java.util.Objects.requireNonNull(a, "a");
        int n = a.length;
        alg_require(((n >= 0) && (n <= 1000000)));
        alg_require((a.length == n));
        alg_require((n >= 1));
        int ending = a[0];
        int best = a[0];
        int i = 1;
        while ((i < n)) {
            ending = Math.max(a[i], Math.addExact(ending, a[i]));
            best = Math.max(best, ending);

function range_sum(array $a, int $left, int $right): int {
    alg_require(array_is_list($a));
    $n = count($a);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((count($a) == $n));
    alg_require((($left >= 0) && ($left <= $right) && ($right < $n)));
    $prefix = array_fill(0, alg_size(alg_add($n, 1)), 0);
    $i = 0;
    while (($i < $n)) {
        $prefix[alg_add($i, 1)] = alg_add($prefix[$i], $a[$i]);
        $i = alg_add($i, 1);
    }