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