Implement Binary Search Algorithm

00:00

5 left

Implement Binary Search Algorithm

EasyPython

Problem

Implement a binary search algorithm that finds the index of a target value in a sorted array. If the target value is not found, return -1.

Input

A sorted list of integers nums.
An integer target to search for.

Output

The index of target in nums or -1 if target is not present.

Constraints

1 <= nums.length <= 10^4
-10^9 <= nums[i] <= 10^9
nums is sorted in ascending order.

Function Signature

def binary_search(nums: list[int], target: int) -> int:

CodePython 3

Sign up free to run your code Log inLn 2

Run your code to see test output here.