edited by
3,125 views
1 votes
1 votes
Find time complexity?

a) T(n) = T(n/2) + pow(2,n)

b) T(n) = T(pow(n,1/2)) + n

c) T(n) = 16T(n/4) + n!

d) T(n) = pow(2,1/2)*T(n/2) + log n

can we apply master theorem on the above problem?
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
2 answers
2
Vashishtha asked Sep 9, 2023
264 views
In a certain base 137 + 254 = 402 then What is the sum of 342 + 562 in that base?
0 votes
0 votes
1 answer
3
Vashishtha asked Sep 7, 2023
164 views
How many factors ofN=12^12×14^14×15^15are multiple ofK=12^10×14^10×15^10 ?
0 votes
0 votes
0 answers
4
Vashishtha asked Sep 4, 2023
152 views
If 1/n + 1 < 1/n+1 + 1 / n + 2 + 1/ n + 3 < ; then n ?a) 9 c) 11b) 10 d) 12