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

by Aditya Y. Bhargava

The constant almost never matters for simple search versus binary search, because O(log n) is so much faster than O(n) when your list gets big.