binary search is most suitable for sorted arrays data list.
binary search is most suitable for what kind of data list?
sorted arrays
however, binary search is usually more efficient for searching as binary search trees will most likely be imperfectly balanced, resulting in slightly worse performance than binary search. this even applies to balanced binary search trees, binary search trees that balance their own nodes, because they rarely produce the tree with the fewest possible levels. except for balanced binary search trees, the tree may be severely imbalanced with few internal nodes with two children, resulting in the average and worst-case search time approaching formula_108 comparisons. binary search trees take more space than sorted arrays.
binary search algorithm
multiplicative binary search





























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 originally proposed to simplify the midpoint index calculation on small computers without efficient division or shift operations, but its cache-friendly nature makes it suitable for out-of-memory static search on block-oriented storage as an alternative to b+ trees.





























multiplicative binary search is used by some optimizing compilers to implement switch statements.





























section::::algorithm.
multiplicative binary search