An algorithm with runtime complexity $T(N)$ has a lower bound and an upper bound.

Lower bound

Upper bound

$[$ Choose $]$

A function $f(N)$ that is $$ the best case $T(N),$ for all values of $N1.$

A function $f(N)$ that is $$ the worst case $T(N),$ for all values of $N1.$