Binary Search

Statement

We are given an array of integers, nums, sorted in ascending order, and an integer value, target. If the target exists in the array, return its index. If the target does not exist, return -1.

Constraints:

• $1$$\leq$ nums.length $\leq$ $10^3$

• $-10^4$$\leq$ nums[i] , target $\leq$ $10^4$

• All integers in nums are unique.

• nums is sorted in ascending order.

Example