Merge Sort in C++

#include <stdio.h>
#include <vector>
#include <algorithm>
#include <stdexcept>
#include <cstdint>
#include <limits>
// Merge Sort in C++
//
// 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
// C++17: const vector references for inputs, mutable references for outputs, RAII workspace,
// standard lower_bound for LIS. Invalid inputs throw invalid_argument; overflow throws
// overflow_error; allocation failure propagates bad_alloc.
//
// EXAMPLE
// Expected return: 0.
// Expected a after call: [1, 1, 3, 5].
// Run: g++ -std=c++17 -O2 example.cpp -o example && ./example
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

static int alg_min(int a, int b) { return a < b ? a : b; }
static int alg_max(int a, int b) { return a > b ? a : b; }
static void alg_require(bool valid) { if (!valid) throw std::invalid_argument("invalid algorithm input"); }
static int alg_checked(int64_t v) { if (v < INT32_MIN || v > INT32_MAX) throw std::overflow_error("32-bit result overflow"); return (int)v; }
static int alg_add(int a,int b) { return alg_checked((int64_t)a+b); }
static int alg_sub(int a,int b) { return alg_checked((int64_t)a-b); }
static int alg_mul(int a,int b) { return alg_checked((int64_t)a*b); }
static size_t alg_size(int n) { alg_require(n>=0 && n<=4000000); return (size_t)n; }

int merge_sort(std::vector<int>& a) {
    alg_require(a.size() <= 1000000);
    int n = (int)a.size();
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require(((int)a.size() == n));
    std::vector<int> buf(alg_size(alg_add(n, 1)), 0);
    int width = 1;
    int left = 0;
    int mid = 0;
    int right = 0;
    int i = 0;
    int j = 0;
    int k = 0;
    while ((width < n)) {
        left = 0;
        while ((left < n)) {
            mid = alg_min(alg_add(left, width), n);
            right = alg_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;
}

int main(void) {
    std::vector<int> a = {5, 1, 3, 1};
    int result = merge_sort(a);
    printf("%d\n", result);
    for (int z = 0; z < 4; z++) printf("%d ", a[z]);
    printf("\n");
    // Expected a: [1, 1, 3, 5]
    return 0;
}