Which notation describes the UPPER BOUND of an algorithm's running time?

Question

Accepted Answer

(C) Big-O (O). Explanation: Big-O notation describes the upper (worst-case) bound of an algorithm's complexity.