The Pragmatic Programmer

by Andy Hunt

If your algorithm halves the set of things it considers each time around the loop, then it is likely to be logarithmic, O(lg(n))