title: Trying to understand the time complexity of a binary search
body: <p>I am trying to understand the Big O notation for the time complexity of a binary search. I understand it is O(log n). So is this basically saying that for a list of 16 elements, it will at maximum take log2(16) = 4 attempts? If that is true how would that work for a list of 12 where the log = 3.6?</p>
  
  <p>Thanks</p>