That is, can the running time of every algorithm $A$ be written as $O(f_A(n))$ and $\Omega(f_A(n))$, for the same function $f_A$?
Can every algorithm's running time be expressed as $\Theta(f(n))$?
algorithms;time complexity