title: Binary search operations
body: <p>Here is an array with exactly 15 elements:</p>
  
  <p>1   2   3   4   5   6   7   8   9   10   11   12   13   14   15</p>
  
  <p>Suppose that we are doing a binary search for an element. Circle any elements that will be found by examining two or fewer numbers from the array.</p>
  
  <p>//////////////////////////////////////////////////////////////////////////////</p>
  
  <p>This is a practice problem from my textbook for my C++ course. I am a little confused because looking up answers online and comparing with my own, they are not matching up. Online people are saying the answer is 8, 4, and 12 while I think it is 7, 11, and 3. </p>