Grokking Algorithms: An illustrated guide for programmers and other curious people

by Aditya Y. Bhargava

In general, for any list of n, binary search will take log2 n steps to run in the worst case, whereas simple search will take n steps.