recategorized by
2,119 views
5 votes
5 votes

$T(n)=\sqrt{n} T(\sqrt{n})+100n$

Please solve this.

recategorized by

3 Answers

Best answer
19 votes
19 votes

ans is O(n log logn)

 

selected by

Related questions

0 votes
0 votes
1 answer
1
iarnav asked Jan 11, 2018
402 views
what is the recurrence relation for binary search and linear search?please explain how to derive them.
1 votes
1 votes
0 answers
2
srestha asked May 19, 2019
594 views
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Co...
1 votes
1 votes
2 answers
3
srestha asked May 10, 2019
844 views
What is the solution of recurrence relation$T\left ( n \right )=T\left ( n-1 \right )+n$
1 votes
1 votes
1 answer
4
VikramRB asked Jan 20, 2019
1,005 views
What is the time complexity of the following recurrence relation and step to derive the same$T(n) = T(\sqrt{n}) + log(logn)$