Binary search

The array is sorted. Return the index of target, or -1 if it isn't there. Binary search halves the range each step: check the middle element, then keep looking in just the left or right half. Far faster than scanning every element.

Complete binarySearch(int[] a, int target) for a sorted array a: return the index of target, or -1 if absent. Use binary search.

public class Search {
    public static int binarySearch(int[] a, 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