To show an upper bound T(n) on the time complexity of a problem, one needs to show only that there is a particular algorithm with running time at most T(n).
A specific algorithm demonstrating T(n) represents what measure of time complexity?
upper bound