Next Lexicographic Permutation in C++

#include <stdio.h>
#include <vector>
#include <algorithm>
#include <stdexcept>
#include <cstdint>
#include <limits>
// Next Lexicographic Permutation in C++
//
// PURPOSE
// Next permutation advances a sequence to its immediate lexicographic successor, including
// sequences with duplicates.
//
// METHOD
// Find the rightmost ascent, swap its left element with the rightmost larger value, then
// reverse the descending suffix. If no ascent exists, reverse the entire array.
//
// COMPLEXITY
// O(n) time and O(1) auxiliary space.
//
// CONTRACT
// Mutates input. Returns 1 when advanced, 0 when wrapped to the first permutation.
// 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: 1.
// Expected a after call: [1, 3, 2].
// 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 next_permutation(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));
    int pivot = alg_sub(n, 2);
    int right = alg_sub(n, 1);
    int left = 0;
    int temp = 0;
    int advanced = 0;
    while (((pivot >= 0) && (a[pivot] >= a[alg_add(pivot, 1)]))) {
        pivot = alg_sub(pivot, 1);
    }
    if ((pivot >= 0)) {
        while ((a[right] <= a[pivot])) {
            right = alg_sub(right, 1);
        }
        temp = a[pivot];
        a[pivot] = a[right];
        a[right] = temp;
        advanced = 1;
    }
    left = alg_add(pivot, 1);
    right = alg_sub(n, 1);
    while ((left < right)) {
        temp = a[left];
        a[left] = a[right];
        a[right] = temp;
        left = alg_add(left, 1);
        right = alg_sub(right, 1);
    }
    return advanced;
}

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