Question 6024 – Algorithms
November 26, 2023Question 7665 – UGC-NET DEC-2019 Part-2
November 26, 2023Question 6356 – Algorithms
T(n)= 8T (n/2)+Cn, if n>1 = b, if n=1
Consider the recurrence relation:
Where b and c are constants. The order of the algorithm corresponding to above recurrence relation is:
Correct Answer: D
Question 321 Explanation:
The above recurrence is in the form of masters theorem.
a=8,b=2,k=0 and p=0
Case-1: a>bk = 8>20
T(n)=O(nlogb^a)
= O(n3)
a=8,b=2,k=0 and p=0
Case-1: a>bk = 8>20
T(n)=O(nlogb^a)
= O(n3)
n
n2
n log n
n3
Subscribe
Login
0 Comments