• retagged by
648 views
0 0 votes
T(n) = 2T( n / root(2)) + n

T(1) = O(1)

when i solve this i get  theta ( n ^ log 2 base root(2)) using masters theorem

after this how do i slove

Please log in or register to answer this question.

Position:
Show:

Related questions

3 3 votes
1 1 answer
852
852 views
srijankarak_123 asked Aug 28, 2024
852 views
find out the time complexity of the given recurrence relation using back substitution method T(n) = T(n/2) + n logn
0 0 votes
0 0 answers
847
847 views
kira000 asked Jan 17, 2023
847 views
Let $f(n)$ be a positive increasing function. Consider the below two statements:S1: if an algorithm is $\Theta(f(n))$ in the average case, then it is $\Omega(f(n))$ in th...