Algorithms: Searching

    static int linear_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 i = 0;
        while ((i < n)) {
            if ((a[i] == target)) {
                return i;
            }
            i = Math.addExact(i, 1);
        }

function linear_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 i = 0;
    while ((i < n)) {
        if ((a[i] == target)) {
            return i;
        }
        i = alg_add(i, 1);

def linear_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)
    i: int = 0
    while i < n:
        if a[i] == target:
            return i
        i += 1
    return -1

int linear_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 i = 0;

int linear_search(const std::vector<int>& a, int target) {
    alg_require(a.size() <= 1000000);
    int n = (int)a.size();
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require(((int)a.size() == n));
    int i = 0;
    while ((i < n)) {
        if ((a[i] == target)) {
            return i;
        }
        i = alg_add(i, 1);
    }