Register

made easy booklet

• edited by
4,872 views
1 1 vote
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?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · No of flip flops req...Next → · doubt
← Previous in category · dynamic prgrammingNext in category → · Time complexity of c...
Position:
Show:

Related questions

0 0 votes
0 0 answers
349
349 views
Çșȇ ʛấẗẻ asked Jul 19, 2023
349 views
Made easy booklet
(a) $\alpha\left(n^{2}\right)$(b) $\alpha(n)$(c) $O(n \log n)$(d) $O\left(n^{2} \log n\right)$Q. 6 Consider the following sorting algorithm.I\[\begin{array}{l}\text { tin...
0 0 votes
2 2 answers
817
817 views
Vashishtha asked Sep 9, 2023
817 views
Made Easy Aptitude Booklet
In a certain base 137 + 254 = 402 then What is the sum of 342 + 562 in that base?
0 0 votes
1 1 answer
449
449 views
Vashishtha asked Sep 7, 2023
449 views
Made Easy Booklet
How many factors ofN=12^12×14^14×15^15are multiple ofK=12^10×14^10×15^10 ?
0 0 votes
0 0 answers
380
380 views
Vashishtha asked Sep 4, 2023
380 views
Made Easy Booklet
If 1/n + 1 < 1/n+1 + 1 / n + 2 + 1/ n + 3 < ; then n ?a) 9 c) 11b) 10 d) 12