title: Binary search to find the rotation point in a rotated sorted list
body: <p>I have a sorted list which is rotated and would like to do a binary search on that list to find the minimum element.</p>
  
  <p>Lets suppose initial list is {1,2,3,4,5,6,7,8}
  rotated list can be like {5,6,7,8,1,2,3,4}</p>
  
  <p>Normal binary search doesn't work in this case. Any idea how to do this.</p>
  
  <p>-- Edit</p>
  
  <p>I have one another condition. What if the list is not sorted??</p>