# Answer to Question #73719 in Algorithms for Timmy

Question #73719

Solve the following recurrence relation (without using Master Theorem)

C(n/2) + logn, for n > 1. C(1) = 0

C(n/2) + logn, for n > 1. C(1) = 0

Expert's answer

#### Not answered

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

## Leave a comment