Binary search

O(log n) target lookup.

searching binary-search

Implement `binary_search(nums: list[int], target: int) -> int`.

Constraints

0 ≤ len(nums) ≤ 10^6. List is sorted ascending. No duplicates.

Example

>>> binary_search([1,2,3,4,5], 3)
2

12 points ~12 min

Recent Submissions

No submissions yet — hit Run Tests to try!

Hints

lo, hi = 0, len-1; mid = (lo+hi)//2; compare and halve.

Test Results

Press Ctrl+Enter or click Run Tests to execute your code.