what is the time complexity for an algorithm that operations to complete grows by 4 when doubling the input length?
Recurrent equation:
$$T(n) = 4 \cdot T(\frac{n}{2})$$
$$T(1) = O(1)$$
Its solution:
$$T(n) = \Theta(n^2)$$