Hello 2010/12/4 bittu <[email protected]>: > find out all the elements in a sorted integer array whose value is > equal to index of the array. O(logn) solution is expected. > I guess, if the elements are different to each other, a binary search to drop some subarrays whose elements could never equal to the index of the array. But I don't know how to analyse the complexity.
-- 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.
