Do a binary search On Sun, Oct 25, 2009 at 12:13 AM, naren <[email protected]> wrote:
> > You have a sorted array of n elements some of them occur more than > once. How can we find the index of an element in time t which is less > than O(n). > > > > -- Luv, S.Antony Vincent Pandian --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
