dsa · easy

Binary Search

GreyOrangeArrayBinary SearchFoundation

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.

Arguments

• nums — the input array of integers
• target — the value you are searching for or summing to

**Example 1:** `` Input: nums = [-1,0,3,5,9,12], target = 9 Output: 4 ``

Constraints

1 <= nums.length <= 4*10^4 Hidden tests include near-max size for this bound; a slower-than-intended solution TLEs.

Examples

Example 1

Input:
[-1,0,3,5,9,12]
9

Expected:
4

Example 2

Input:
[-1,0,3,5,9,12]
2

Expected:
-1

Open in the Dojo editor