[algogeeks] Re: Algorithm complexity

2011-08-03 Thread Ajai Sathyan
Thanks guys... On Aug 4, 12:15 am, raj kumar wrote: > Searching a node in a tree of string or integer arrays and then using binary > search withinn that node to retrive a particular value -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To p

[algogeeks] Algorithm complexity

2011-08-03 Thread Ajai Sathyan
Can u suggest a program with complexity O( log log n ) ? -- 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 algogeeks+unsubscr...@goo

[algogeeks] Algorithm complexity

2011-08-03 Thread Ajai Sathyan
Can you suggest a sample program which has complexity O(log log n)? Regards Ajai Sathyan -- 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 g