Big O mathematical notation

Big O is a recurring research-paper notation family. Describes an asymptotic upper growth class while suppressing constants and lower-order terms.

Big O: Describes an asymptotic upper growth class while suppressing constants and lower-order terms. Example: For sufficiently large n, runtime grows no faster than a constant times n squared.