i doubt if it is possible in O(logn)..... i think you can first 'k' in one traversal and then make the array as it was before in O(n) and then apply binary search.....so its basically a O(n) solution...
if anyone has better ideas then please share !!. -- Amol Sharma Third Year Student Computer Science and Engineering MNNIT Allahabad On Fri, Aug 12, 2011 at 3:17 PM, jagrati verma <[email protected]>wrote: > to implement a binary search in an array which is sorted but roated by > some k places which is nt kwn .... time complexity O(logn) > > -- > 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. > > -- 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.
