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 <ajaisath...@gmail.com> 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.
