Binary search to find the rotation point in a rotated sorted list
        Posted  
        
            by Algorist
        on Stack Overflow
        
        See other posts from Stack Overflow
        
            or by Algorist
        
        
        
        Published on 2010-05-09T02:35:01Z
        Indexed on 
            2010/05/09
            2:58 UTC
        
        
        Read the original article
        Hit count: 343
        
I am having a sorted list which is rotated and I would like to do a binary search on that list to find the minimum element.
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}
Normal binary search doesn't work in this case. Any idea how to do this.
© Stack Overflow or respective owner