Wrong. Counterexample: 1 2 2 2 2 6 On Dec 4, 5:46 pm, Atul <atul.ii...@gmail.com> wrote: > Hint: check the middle of array if a[middle]>middle dont need to check again > after middle > > Now you can solve this. > > > > > > > > > > On Sat, Dec 4, 2010 at 3:53 PM, bittu <shashank7andr...@gmail.com> wrote: > > find out all the elements in a sorted integer array whose value is > > equal to index of the array. O(logn) solution is expected. > > > Regards > > Shashank > > > -- > > 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<algogeeks%2bunsubscr...@googlegroups > > .com> > > . > > For more options, visit this group at > >http://groups.google.com/group/algogeeks?hl=en. > > -- > -- > Atul
-- 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.
