I am having trouble solving recurrence relations, probably because I am missing the basics.
Is there any web reference/book I can read to help me cover the basics?
I watched some lectures and read the chapter but it seems like it's not enough. I don't have the slightest clue about how to solve that does not fit in the Master-method.
Take the following recurrence for example: $T(n) = T(n - a) + T(a) + n^2 \;\;a > 1 (constant)$
Even when I try to calculate it with Recursion-tree it does not seem to make sense. It has a pattern I just don't know how to express it.
Thanks for any help!
My recursion tree looks like like this: $$n^2$$ $$ (n-a)^2 \;\;\;\;\;\;\;\; a^2 $$ $$(n-2a)^2 \;\; a^2 \;\; T(0) \;\; a^2$$