Register

Analysis of Algorithms (Recurrences)

• retagged by
1,184 views
0 0 votes

Consider the following recurrence.

T(n) = T(\sqrt{n}) + \Theta(Log Log n)

What is the value of recurrence?

please explain in detail

1 Answer

1 1 vote

by using this method 

I got order of (loglogn)^2

Voting & Accepting an answer helps improve the community
← Previous · Programming In CNext → · Programming and DS
← Previous in category · algorithmNext in category → · Time Complexity of I...
Position:
Show:

Related questions

0 0 votes
1 1 answer
662
662 views
Hardik1997 asked May 20, 2017
662 views
What is the value of the following recurrences?
1 :- T(n) = T(n-2) + n22 :- T(n) = 4T(n/3) + nlgn3 :- T(n) = 3T(n/3 - 2) + n/2
3 3 votes
2 answers 2 answers
5.0k
5.0k views
Regina Phalange asked Mar 4, 2017
4,989 views
Algorithm(Recurrences)
What is the value of following recurrence.T(n) = T(n/4) + T(n/2) + cn^2 T(1) = c T(0) = 0Where c is a positive constantA) O(n^3)B) O(n^2)C) O(n^2logn)D) O(nlogn)
4 4 votes
1 answers 1 answer
3.3k
3.3k views
Shyam Singh 1 asked May 9, 2016
3,282 views
Recurrences
What will be time complexity for both recurrences?$$T(n) = \begin{cases}2 \cdot T \left ( \sqrt n \right ) + \log n & \text{if } n 4\\[1em]1 & \text {if } n \leq 4\end{c...
1 1 vote
1 answers 1 answer
899
899 views
Aspi R Osa asked Dec 14, 2015
899 views
are these two recurrences equivalent?
Do they differ or are they same?they are confusing me/