Algorithms
November 14, 2023Algorithms
November 14, 2023Time-Complexity
|
Question 6
|
The recurrence relation
T(1) = 2 T(n) = 3T(n/4)+n
has the solution, T(n) equals to
|
O(n)
|
|
|
O(log n)
|
|
|
O(n3/4)
|
|
|
None of the above
|
Question 6 Explanation:
Apply Master’s theorem.
Correct Answer: A
Question 6 Explanation:
Apply Master’s theorem.