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.

The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal.