retagged by
259 views

1 Answer

Best answer
2 votes
2 votes

t(n)=√nt(√n)+n
using recurence tree method
every time our main problem goes decreases to n->n1/2->n1/4......n1/2^k
nd cost of reduction for size k is √k where k is a function of n 
so after how much time our subproblem becom of size 1 0r 2 i mean when cost becomes constant
.n1/2^k=2  k=loglogn
here cost at each level is same at each level bcoz our main problem is uniformally divided =n
so  total cost using recurence tree method =
    no of levels*cost at each level = loglogn * n=nloglogn
Ans=θ(nloglogn)

selected by

Related questions

1 votes
1 votes
0 answers
1
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
2
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
3
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)$
1 votes
1 votes
1 answer
4
Mayankprakash asked Jan 4, 2019
1,265 views
T(n) = T(n/4) + T(3n/4) + nHow to solve these type of problems?Can I solve this using master theorm by considering X = T(3N/4) +N THEN T(N) = T(N/4) +XCAN WE SOLVE LIKE T...