Binary search

The array is sorted and has n elements. Return the index of target, or -1 if it isn't present. Keep lo and hi bounds, check the middle each step, and discard the half that can't contain the target.

Complete int binary_search(const int *a, int n, int target) for a sorted array of length n: return the index of target, or -1 if absent.

/* Return the index of target in the sorted array, or -1. Do not write main(). */
int binary_search(const int *a, int n, int target) {
    return -1;   /* change this */
}

Click Run to see the output here.

Next lesson →

Binary search

Binary search

Log in or create account

Feedback & help