Cocktail Sort in Java

// Cocktail Sort in Java
//
// PURPOSE
// Cocktail sort is a comparison-sort variant useful for understanding alternative ways to
// move misplaced values.
//
// METHOD
// Alternate forward and backward adjacent-swap passes, shrinking both ends and stopping when
// no swaps occur.
//
// COMPLEXITY
// O(n squared) worst-case time and O(1) auxiliary space. 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
// Java 17+: primitive int arrays, Arrays.binarySearch for LIS, and Math exact arithmetic.
// Invalid input throws IllegalArgumentException; arithmetic overflow throws
// ArithmeticException.
//
// EXAMPLE
// Expected return: 0.
// Expected a after call: [1, 1, 3, 4].
// Run: javac AlgorithmExample.java && java AlgorithmExample
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

class AlgorithmExample {
    static void alg_require(boolean valid) { if (!valid) throw new IllegalArgumentException("invalid algorithm input"); }
    static int alg_size(int n) { alg_require(n>=0 && n<=4000000); return n; }

    static int cocktail_sort(int[] a) {
        java.util.Objects.requireNonNull(a, "a");
        int n = a.length;
        alg_require(((n >= 0) && (n <= 1000000)));
        alg_require((a.length == n));
        int low = 0;
        int high = Math.subtractExact(n, 1);
        int i = 0;
        int changed = 1;
        int temp = 0;
        while (((low < high) && (changed != 0))) {
            changed = 0;
            i = low;
            while ((i < high)) {
                if ((a[i] > a[Math.addExact(i, 1)])) {
                    temp = a[i];
                    a[i] = a[Math.addExact(i, 1)];
                    a[Math.addExact(i, 1)] = temp;
                    changed = 1;
                }
                i = Math.addExact(i, 1);
            }
            high = Math.subtractExact(high, 1);
            i = high;
            while ((i > low)) {
                if ((a[Math.subtractExact(i, 1)] > a[i])) {
                    temp = a[i];
                    a[i] = a[Math.subtractExact(i, 1)];
                    a[Math.subtractExact(i, 1)] = temp;
                    changed = 1;
                }
                i = Math.subtractExact(i, 1);
            }
            low = Math.addExact(low, 1);
        }
        return 0;
    }

    public static void main(String[] args) {
        int[] a = new int[] {4, 1, 3, 1};
        int result = cocktail_sort(a);
        System.out.println(result);
        // Expected a: [1, 1, 3, 4]
        System.out.println(java.util.Arrays.toString(a));
    }
}