title: binary search in array that contains range
body: <p>let's say that we have an ordered array contains elements like this ,</p>
  
  <p>[1, 2-5, 6, 8-9, 11-13] , 2-5 is a range that represents 2, 3, 4 and 5, if we want to find "4" then index 1 (start from 0) is answer we need. </p>
  
  <p>It's that possible we apply binary search like this type of elements with constans space and log(n) time?</p>