{"version":"1.0","type":"link","title":"Multiplicative binary search - Newikis","description":"In computer science, multiplicative binary search is a variation of binary search that uses a specific permutation of keys in an array instead of the sorted order used by regular binary search. Multiplicative binary search was first described by Thomas Standish in 1980. This algorithm was…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/3/3b/Multiplicative_Binary_Search_Depiction.svg/1280px-Multiplicative_Binary_Search_Depiction.svg.png","thumbnail_width":1280,"thumbnail_height":545}