Comb Sort in Python

from bisect import bisect_left

# Comb Sort in Python
#
# PURPOSE
# Comb sort is a comparison-sort variant useful for understanding alternative ways to move
# misplaced values.
#
# METHOD
# Compare gap-separated elements, shrink the gap by approximately 1.3, and finish with gap-
# one passes until no swaps occur.
#
# COMPLEXITY
# O(n squared) worst-case time and O(1) auxiliary space. Not stable.
#
# CONTRACT
# Sorts ascending in place and returns 0. Intended for small collections; use a general-
# purpose O(n log n) sort for large workloads.
# 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, 4].
# 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 comb_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)
    gap: int = n
    changed: int = 1
    i: int = 0
    temp: int = 0
    while gap > 1 or changed != 0:
        gap = max(1, gap * 10 // 13)
        changed = 0
        i = 0
        while i + gap < n:
            if a[i] > a[i + gap]:
                temp = a[i]
                a[i] = a[i + gap]
                a[i + gap] = temp
                changed = 1
            i += 1
    return 0

a = [4, 1, 3, 1]
result = comb_sort(a)
print(result)
# Expected a: [1, 1, 3, 4]
print(a)