Algorithms: Searching

function exponential_search(array $a, int $target): int {
    alg_require(array_is_list($a));
    $n = count($a);
    alg_require((($n >= 0) && ($n <= 1000000)));
    alg_require((count($a) == $n));
    if (($n == 0)) {
        return alg_sub(0, 1);
    }
    if (($a[0] == $target)) {
        return 0;
    }
    $bound = 1;

    static int jump_search(int[] a, int target) {
        java.util.Objects.requireNonNull(a, "a");
        int n = a.length;
        alg_require(((n >= 0) && (n <= 1000000)));
        alg_require((a.length == n));
        int step = 1;
        while ((step <= (n / step))) {
            step = Math.addExact(step, 1);
        }
        int start = 0;
        int end = Math.min(step, n);
        while (((start < n) && (a[Math.subtractExact(end, 1)] < target))) {

function jump_search(a, target) {
    alg_require(a instanceof Int32Array);
    alg_require(Number.isInteger(target) && target >= -2147483648 && target <= 2147483647);
    let n = a.length;
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require((a.length == n));
    let step = 1;
    while ((step <= Math.floor(n / step))) {
        step = alg_add(step, 1);
    }
    let start = 0;
    let end = Math.min(step, n);

def jump_search(a: list[int], target: int) -> int:
    alg_require(isinstance(a, (list, tuple)) and len(a) <= 1000000)
    alg_require(type(target) is int and -2147483648 <= target <= 2147483647)
    n: int = len(a)
    alg_require(n >= 0 and n <= 1000000)
    alg_require(len(a) == n)
    step: int = 1
    while step <= n // step:
        step += 1
    start: int = 0
    end: int = min(step, n)
    while start < n and a[end - 1] < target:

int jump_search(const int *a, size_t a_length, int target) {
    int alg_error = 0;
    int alg_result = INT_MIN;
    errno = 0;
    if (a_length > 1000000 || (a_length && !a)) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    int n = (int)a_length;
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((n >= 0) && (n <= 1000000)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (!(((int)a_length == n))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    int step = 1;