@ Decipher: Q1) find where the rotation begins and do binary search in the first half or the second half depending upon the search element
On Sun, Sep 25, 2011 at 8:58 PM, Decipher <[email protected]> wrote: > Q1) A sorted array is rotated unknown number of times , write an algorithm > to search an element in this rotated array in O(log n) . > Hint : Modify binary search > > Q2) Write an algorithm to traverse a rectangular matrix spirally. > > > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/0WBV1uzAe5AJ. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- *prasanth* -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
