array: 4,5,1,2,3 index: 0,1,2,3,4 real index: 3,4,0,1,2 suppose the index of the least element is k (here k=2) then when you're applying the binary search the only modification you need to have is each time you're going to access the ith element of array look at (i+k)%n th element
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
