Using Substitution to Prove an Big O/upper bound is O(n^3)

I need to use a substitution method to prove and show that T(n) is in O(n³) for

$T(n) = 2T(\lfloor \frac{n}{2} \rfloor) + 5n^3 $ 

for n ≥ 2, T(1) = 20

I am supposed to come up with an explicit guess for the upper bound instead of trying to reason using order notation.



Answers can only be viewed under the following conditions:
  1. The questioner was satisfied with and accepted the answer, or
  2. The answer was evaluated as being 100% correct by the judge.
View the answer

1 Attachment

Erdos Erdos
  • Erdos Erdos

    It took me about 35 minutes to write this solution. You should offer higher amounts in future, otherwise your questions may not get answered.

The answer is accepted.
Join Matchmaticians Affiliate Marketing Program to earn up to a 50% commission on every question that your affiliated users ask or answer.