If you have a square region that holds various numbers, what is the result of each recurrence relation?:
T(n) = 3T(n/2) + c and T(n) = 2T(n/2) + cn
I know the first is supposed to result in a quad partition and the second a binary partition, but I can't intuitively wrap my head around why this is the case. Why are we making 3 recursive calls in the first case and 2 in the second? Why does the +c or +cn effect what we're doing with the problem?