Merge Sort in JavaScript

"use strict";
// Merge Sort in JavaScript
//
// PURPOSE
// Merge sort combines sorted runs into larger runs. The bottom-up form avoids recursion and
// guarantees predictable worst-case performance.
//
// METHOD
// Merge adjacent runs of width one into a temporary buffer, copy back, then double the
// width. Each pass leaves runs of twice the previous width sorted.
//
// COMPLEXITY
// O(n log n) time and O(n) auxiliary space. Stable because ties are taken from the left run.
//
// CONTRACT
// Sorts n elements ascending in place; returns 0. Empty input is valid. Uses a temporary
// buffer.
// 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: 0.
// Expected a after call: [1, 1, 3, 5].
// 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 merge_sort(a) {
    alg_require(a instanceof Int32Array);
    let n = a.length;
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require((a.length == n));
    let buf = new Int32Array(alg_size(alg_add(n, 1)));
    let width = 1;
    let left = 0;
    let mid = 0;
    let right = 0;
    let i = 0;
    let j = 0;
    let k = 0;
    while ((width < n)) {
        left = 0;
        while ((left < n)) {
            mid = Math.min(alg_add(left, width), n);
            right = Math.min(alg_add(left, alg_mul(2, width)), n);
            i = left;
            j = mid;
            k = left;
            while ((k < right)) {
                if (((i < mid) && ((j >= right) || (a[i] <= a[j])))) {
                    buf[k] = a[i];
                    i = alg_add(i, 1);
                } else {
                    buf[k] = a[j];
                    j = alg_add(j, 1);
                }
                k = alg_add(k, 1);
            }
            left = alg_add(left, alg_mul(2, width));
        }
        i = 0;
        while ((i < n)) {
            a[i] = buf[i];
            i = alg_add(i, 1);
        }
        width = alg_mul(width, 2);
    }
    return 0;
}

let a = new Int32Array([5, 1, 3, 1]);
let result = merge_sort(a);
console.log(result);
console.log(a);
// Expected a: [1, 1, 3, 5]