Big O Notation: A mathematical notation that describes the upper-bound performance or complexity of an algorithm. Time Complexity: ... In Codeless Data Structures and Algorithms, pp. 3–17.