Question: Solve the following recurrence. (This one occurs in a well-known matrix multiplication algorithm that we're not studying.)
T(n) = 7 T(n / 2) + n^2 T(1) = 1
Answer:
T(n) = O( n^(lg 7) ) (where lg is a base-2 logarithm)