1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Can I use the Master Theorem here? (Algorithm Complexity)

  1. Oct 19, 2015 #1
    1. The problem statement, all variables and given/known data
    What is the complexity of the following recurrence: T(n) = (9/4)T((2/3)n) + n²

    2. Relevant equations
    My question is: can I use the Master Theorem here?

    3. The attempt at a solution
    My attemp:
    a=9/4
    b=3/(1/2) (this is where I think I may be wrong)
    f(n) = n²

    so, in this case T(n) would be theta(n²) because it would be greater than n^(log_b_a)

    Anyway, the point is if I can use Master Theorem and what would be the value of b.

    PS: English is not my native english. Sorry for the grammar.
     
  2. jcsd
  3. Oct 20, 2015 #2
    You are right. Are you in cmps101 at ucsc?
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Similar Discussions: Can I use the Master Theorem here? (Algorithm Complexity)
Loading...