Binary Search

Easy

/problems/binary-search

2000 ms128 MB2 visible tests

Problem statement

Find a target value in an ascending list of distinct integers. Return its index when found, otherwise return -1.

Implement this function and return the result. CodeSprint supplies each test case automatically.

binarySearch(nums, target) → number

nums: number[]target: number

Example 1

Input

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

Output

Example 2

Input

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

Output

-1

Constraints

0 <= nums.length <= 100,000
nums is sorted in strictly ascending order.