Consider two algorithms A and B for the same problem. Runtime complexity of

algorithm A satisfies the recurrence

$T_A(n)=\{\begin{array}{cc}{c}_1,& n=1\\ 15T_A(\frac{n}{4})+d_1{n}^2,& n>1\end{array}$

for some constants $c_1,d_1.$

Runtime complexity of algorithm B satisfies the recurrence

$T_B(n)=\{\begin{array}{cc}{c}_2,& n=1\\ 4T_B(\frac{n}{2})+d_2{n}^2,& n>1\end{array}$

for some constants $c_2,d_2.$ Based on this information we can deduce that

Algorithms A and $B$ have the same asymptotic run$-$time complexity

Algorithm A is asymptotically faster than algorithm B

Algorithm $A$ is asymptotically slower than algorithm $B$

We can not compare running times of A and $B$