No, I think O(n) is the best method one can use
-- Mohammad Moghimi double m[] = { 9580842103863.650391, 133470973390.236450, 270}; int main(){m[2]--?m[0]*=4,m[1]*=5,main():printf(m);} 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 ???? > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---