Insertion Sort in Python

from bisect import bisect_left

# Insertion Sort in Python
#
# PURPOSE
# Insertion sort grows a sorted prefix by inserting the next value into its proper position.
# It works well for small or nearly sorted arrays.
#
# METHOD
# Save the next key, shift larger prefix values to the right, then place the key in the gap.
# Using a strict comparison preserves the relative order of equal values.
#
# COMPLEXITY
# O(n squared) worst-case time, O(n) best-case time, O(1) auxiliary space. Stable.
#
# CONTRACT
# Sorts n elements ascending in place; returns 0.
# 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
# Python 3.9+: automatic lengths, native lists, arbitrary-precision arithmetic, and
# bisect_left for LIS. Invalid scalar/shape inputs raise ValueError. Integer element types
# and sorted/tree invariants remain caller preconditions.
#
# EXAMPLE
# Expected return: 0.
# Expected a after call: [1, 1, 3, 5].
# Run: python example.py
# Tests for this exact source artifact run before publication. The accompanying source
# archive includes unit cases, runtime results, and source hashes.

def alg_require(condition):
    if not condition:
        raise ValueError("invalid algorithm input; see contract")
def alg_size(n):
    alg_require(0 <= n <= 4000000)
    return n

def insertion_sort(a: list[int]) -> int:
    alg_require(isinstance(a, list) and len(a) <= 1000000)
    n: int = len(a)
    alg_require(n >= 0 and n <= 1000000)
    alg_require(len(a) == n)
    i: int = 1
    j: int = 0
    key: int = 0
    while i < n:
        key = a[i]
        j = i - 1
        while j >= 0 and a[j] > key:
            a[j + 1] = a[j]
            j -= 1
        a[j + 1] = key
        i += 1
    return 0

a = [5, 1, 3, 1]
result = insertion_sort(a)
print(result)
print(a)
# Expected a: [1, 1, 3, 5]