Help memorizing piecewise defined formula?

Homework and Study Help
1

Hi Guys,

I don’t have much experience memorizing formulae. Here is what I’m stuck on currently:

Master Method Equation, T(n), which describes the time complexity of recursive algorithms:

T(n) = a T(n/b) + O(n^d), where

  • a is the rate of subproblem proliferation,
  • b^d is the rate of work shrinkage,

Equals:
1. n^d * log n, if a=b^d (think of it as “a tie”)
2. n^d, if a<b^d (think of it as the forces of good win)
3. n^[log-b a], if a>b^d (think of it as the forces of evil win)

Any ideas would help. I have a lot of these types of things to remember so, I’ll try to generalize any advice I get. Thanks!!
Best,.
Moo

2