 Multiplicative binary search

Multiplicative binary search is a variation of the standard binary search algorithm that is particularly useful when you're trying to find the smallest or largest index of a value in a sorted array or list, especially when the range of values is unknown or not well-defined. It combines elements of both expansion and binary searching.