If you have a vector, then why would you use linked list in the first place?? :)
On Wed, Jun 11, 2008 at 10:03 PM, Geoffrey Summerhayes <[EMAIL PROTECTED]> wrote: > > > > On Jun 11, 12:09 pm, "Douglas Diniz" <[EMAIL PROTECTED]> wrote: >> Well, if you have a classic linked list, O(n) is the best for you. But you >> can do better if you have a sorted linked list. In every node keep a vector >> of pointers for all other nodes. Then you can simulate a binary search. >> > > LOL ... Ummm, this IS a joke, right? > > --- > 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 -~----------~----~----~----~------~----~------~--~---
