TemperTemper

Binary Search

Find the index of an element in a sorted array using binary search with O(log n) time complexity.

Code

Algorithms
import bisect
i = bisect.bisect_left(arr, target)
return i if i < len(arr) and arr[i] == target else -1

Parameters

Sorted array

Element to find

Server

More Python Snippets

Array Difference

Find elements in the first array that are not present in the second array.

Array Frequencies

Count how many times each value appears in an array and return a frequency map.

Array Head

Get the first n elements of an array.

Array Intersection

Find common elements that exist in both arrays.

Array Tail

Get the last n elements of an array.

Array Union

Combine two arrays and remove duplicates to produce a union.