answer is option A . On Sat, Jul 2, 2011 at 8:32 PM, KK <kunalkapadi...@gmail.com> wrote:
> 3. Consider the following recurrence: > > T(n) = 2T(n ^ (1/2)) + 1 > > Which one of the following is true? > (A) T(n) = (loglogn) > (B) T(n) = (logn) > (C) T(n) = (sqrt(n)) > (D) T(n) = (n) > > Can we solve this using master theorem??? > any other way??? > > -- > 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. > > -- 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.
