Question 10117 – Time-Complexity
November 14, 2023
Question 10144 – Time-Complexity
November 14, 2023
Question 10117 – Time-Complexity
November 14, 2023
Question 10144 – Time-Complexity
November 14, 2023

Question 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.
A
O(n)
B
O(log n)
C
O(n3/4)
D
None of the above
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!