Find an elegant way of getting the minimum value in a sorted array but it has been rotated by some number. say u had the array as 4 , 5, 6, 7, 8,9 and u rotate it by 2. u get 6,7,8,9,4,5. Now u have to find minimum number in this modified array.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
