On Jun 22, 3:01 pm, Tejas Kokje <[EMAIL PROTECTED]> wrote:
> On Jun 11, 12:25 am, "zee 99" <[EMAIL PROTECTED]> wrote:
>
> > is this the best one even if the list is sorted ( or any other constraint
> > like this is applied ) ??
>
> > On 6/11/08, Mohammad Moghimi <[EMAIL PROTECTED]> wrote:
>
> > > No, I think O(n) is the best method one can use
> > > On Wed, Jun 11, 2008 at 10:03 AM, zee99. 99 <[EMAIL PROTECTED]> wrote:
>
> > >> is there any algo that can search a linked list in less than O(n) time
> > >> ????
>
> If the list is sorted, you can use binary search with O(log N)
> complexity.
That's incorrect, you need a data structure with O(1) access to
its elements for this to work. Are you thinking of an array?
----
Geoff
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
