Operation Count for Binary Search
Suppose list has N = 2^n - 1 elements
After first comparison, either found the item you are looking for or narrowed search down to 2^(n-1) - 1 elements
After second comparison, either found the item you are looking for or narrowed search down to 2^(n-2) - 1 elements