$T\left ( n,c \right )=\Theta \left ( n \right )$ for $c\leq 2$
$T\left ( c,n \right )=\Theta \left ( n \right )$ for $c\leq 2$
$T\left ( n,n \right )=\Theta \left ( n \right )+T\left ( n,\frac{n}{2} \right )$
How to find complexity for this recurrence relation?
