Find the index of an element in a sorted array using binary search with O(log n) time complexity.
Code
Algorithmsi = arr.bsearch_index { |x| x >= target }
return (i && arr[i] == target) ? i : -1Parameters
Sorted array
Element to find
Server
More Ruby 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.