[solved] – Question 73687
Solve the following recurrence relation (without using Master Theorem)
C(n) = C(n/2) + logn, for n > 1.C(1) = 0
Expert Answer
OR
Solve the following recurrence relation (without using Master Theorem)
C(n) = C(n/2) + logn, for n > 1.C(1) = 0
OR