[algogeeks] Re: Algorithm complexity

2011-08-03 Thread Dumanshu
Check interpolation which is a substitute for binary search for a
uniformly sorted array. It has complexity of this order.

On Aug 3, 7:31 pm, Ajai Sathyan  wrote:
>  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 group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



[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 post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



Re: [algogeeks] Re: Algorithm complexity

2011-08-03 Thread Prakash D
lol.. nice one :D

On Thu, Aug 4, 2011 at 12:30 AM, Don  wrote:

>n = 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...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.



[algogeeks] Re: Algorithm complexity

2011-08-03 Thread Don
int main()
{
  double n;
  printf("Enter n:");
  scanf("%lf", &n);
  while(n > 1.0)
n = log(log(n));
  return 0;
}

On Aug 3, 9:41 am, Ajai Sathyan  wrote:
> 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...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.