Binary Search

easy

Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.

You must write an algorithm with O(log n) runtime complexity.

Test Cases

Copy an input into the main harness and Run to verify

Input

nums = [-1,0,3,5,9,12], target = 9

Expected Output

4

Input

nums = [-1,0,3,5,9,12], target = 2

Expected Output

-1

Constraints

1 <= nums.length <= 10^4
-10^4 < nums[i], target < 10^4
All the integers in nums are unique.
nums is sorted in ascending order.

Hints

Hint 1 — click to reveal

Maintain an inclusive search range [lo, hi].

Hint 2 — click to reveal

Use lo + (hi - lo) / 2 to avoid overflow.

Java Compiler