Kadane Maximum Subarray in JavaScript

"use strict";
// Kadane Maximum Subarray in JavaScript
//
// PURPOSE
// Kadane algorithm finds the largest sum of a contiguous nonempty subarray. At each
// position, a best ending subarray either extends the previous one or starts here.
//
// METHOD
// Track the best sum ending at the current position and the best seen anywhere. If extending
// is worse than restarting, start at the current value.
//
// COMPLEXITY
// O(n) time and O(1) auxiliary space.
//
// CONTRACT
// n >= 1. Returns the maximum sum, including the largest element when all values are
// negative. Sums must fit the integer type.
// 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
// Node.js 18+: Int32Array inputs and workspaces provide compact integer storage. Automatic
// lengths and checked arithmetic reject values outside signed 32-bit. Invalid inputs or
// overflow throw RangeError.
//
// EXAMPLE
// Expected return: 6.
// Run: node example.js
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

function alg_require(valid) { if (!valid) throw new RangeError("invalid algorithm input"); }
function alg_checked(v) { if (!Number.isInteger(v) || v < -2147483648 || v > 2147483647) throw new RangeError("32-bit result overflow"); return v; }
function alg_add(a,b) { return alg_checked(a+b); }
function alg_sub(a,b) { return alg_checked(a-b); }
function alg_mul(a,b) { return alg_checked(a*b); }
function alg_size(n) { alg_require(Number.isInteger(n) && n>=0 && n<=4000000); return n; }

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);
        i = alg_add(i, 1);
    }
    return best;
}

let a = new Int32Array([-2, 1, -3, 4, -1, 2, 1, -5, 4]);
let result = maximum_subarray(a);
console.log(result);