Big O Notation - Graph View A notation that describes the asymptotic upper bound on how an algorithm's running time or memory use grows as the size of its input increases. View concept details Related ConceptsRecursion Memoization ← Back to full graph