Binary search in Java
Java interview exercise on Algorithms & recursion, difficulty 1 of 3. Solve it in the editor beside a worked example; the tests run the moment you do.
Write binarySearch(sorted, target) that returns the index of target in an ascending int array, or -1, by halving the range each step (low, high and mid; compare sorted[mid] with target). Avoid mid overflow with low + (high - low) / 2.
Each exercise pairs a worked example with a twin problem to solve in a real editor; the tests run the moment you do. Progress is saved in your browser, and in your account if you sign in.