Exponential Search in C#

using System;
// Exponential Search in C#
//
// PURPOSE
// Exponential search locates a search interval by doubling its size, then uses binary
// search.
//
// METHOD
// Check index zero. Double a bound until it passes the target or the input end, then binary-
// search the bounded interval.
//
// COMPLEXITY
// O(log(p+1)) comparisons for a match near index p; O(log n) worst case, O(1) space.
//
// CONTRACT
// Ascending input; returns any matching index or -1.
// 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# / .NET 10: ReadOnlySpan<int> inputs, Span<int> outputs, primitive workspace arrays,
// Array.BinarySearch for LIS, and checked integer arithmetic. Invalid arguments and overflow
// throw exceptions.
//
// EXAMPLE
// Expected return: 2.
// Run: Use Program.cs in a net10.0 console project; dotnet run.
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

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

    static int exponential_search(ReadOnlySpan<int> a, int target) {
        checked {
            int n = a.Length;
            alg_require(((n >= 0) && (n <= 1000000)));
            alg_require((a.Length == n));
            if ((n == 0)) {
                return (-1);
            }
            if ((a[0] == target)) {
                return 0;
            }
            int bound = 1;
            while (((bound < n) && (a[bound] < target))) {
                if ((bound > (n / 2))) {
                    bound = n;
                } else {
                    bound = (bound * 2);
                }
            }
            int low = (bound / 2);
            int high = Math.Min(bound, (n - 1));
            int mid = 0;
            while ((low <= high)) {
                mid = (low + ((high - low) / 2));
                if ((a[mid] == target)) {
                    return mid;
                }
                if ((a[mid] < target)) {
                    low = (mid + 1);
                } else {
                    high = (mid - 1);
                }
            }
            return (-1);
        }
    }

    static void Main() {
        int[] a = new int[] {1, 3, 5, 7};
        int target = 5;
        int result = exponential_search(a, target);
        Console.WriteLine(result);
    }
}