Suppose we have a recursive function, \(T(n)\),

\[T(n)=2T\left(\frac{n}{2}\right) + O(n)\]

What is the best asymptotic bound for \(T(n)\)?

**Bonus:** Can you describe a well known algorithm that has a recurrence that looks like this?

×

Problem Loading...

Note Loading...

Set Loading...