The recurrence relation T(1) = 2 T(n) = 3T(n/4)+n has the solution, T(n)…
GATE · 1996 · CS · Question 2 subparts
The recurrence relation
T(1) = 2
T(n) = 3T(n/4)+n
has the solution, T(n) equals to
- A.
O(n)
- B.
O(log n)
- C.
O(n3/4)
- D.
None of the above
Attempted by 228 students.
Sign up free to check your answer
Sign up freeLoading lesson…