Can not figure out complexity of this recurrence

Question

I am refreshing on Master Theorem a bit and I am trying to figure out the running time of an algorithm that solves a problem of size n by recursively solving 2 subp

Answer 1

Looks like you can't formulate this problem in terms of the Master Theorem.

A good start is to draw the recursion tree to understand the pattern, then prove it with the substitution method. You can also expand the formula a couple of times and see where it leads.

See also this question which solves 2 subproblems instead of a: Time bound for recursive algorithm with constant combination time