retagged by
333 views

1 Answer

Best answer
2 votes
2 votes

So, answer is option b.

selected by

Related questions

1 votes
1 votes
2 answers
1
3 votes
3 votes
1 answer
2
Ashish Sharma 3 asked Jun 16, 2017
1,696 views
What will be the time complexity for the following recurrence relation?$T(n) = 8\sqrt{n} T(\sqrt{n})+(log n)^{2}$According to me it is $\Theta (n(logn)^{3})$ . Please con...
1 votes
1 votes
1 answer
3