368 views

1 Answer

0 votes
0 votes
neglecting the constants the series is like n^0 + n^1 + n^2 + ...... + n^n ..hence complexity will be O(n^n)

Related questions

0 votes
0 votes
1 answer
1
1 votes
1 votes
1 answer
2
sripo asked Nov 14, 2018
1,573 views
T(n)=T(n/2)+2; T(1)=1when n is power of 2 the correct expression for T(n) is:a) 2(logn+1)b) 2lognc)logn+1d)2logn+1
2 votes
2 votes
1 answer
3
Vaniyesho asked Dec 1, 2016
1,295 views
What is the time complexity of T(n)=T(n-1)+√(n-1)
0 votes
0 votes
1 answer
4
lucasbbs asked Feb 28, 2022
6,581 views
How do I apply the master theorem in the above recurrence? Please give details about which case and on hiow to solve the asymptotic analysis...