Big-O notation term
upper bound on growth — worst-case complexity
Says 'no slower than this asymptotically.' O(1) constant, O(log n) logarithmic, O(n) linear, O(n log n) sort, O(n²) quadratic. Used loosely in practice to describe algorithm cost.
upper bound on growth — worst-case complexity
Says 'no slower than this asymptotically.' O(1) constant, O(log n) logarithmic, O(n) linear, O(n log n) sort, O(n²) quadratic. Used loosely in practice to describe algorithm cost.