| skos:altLabel | - O
- O(''n'' log ''n'')
- O(n)
- complexity
- computational complexity
- constant time
- linear
- time
- operations
- quantity
- order
- scales
- Õ
- o
- also written
- exponentially
- upper bound
- or
- Big-O
- Θ
- Ω
- asymptotically
- second-order
- bits
- asymptotic
- ''O''
- O(''N'')
- O(''n'')
- O(1)
- O(N)
- Asymptotically
- asymptotic time complexity
- asymptotically faster
- analysis of algorithms
- lower bounds
- bounded by
- modern notation
- Big_O_notation#Extensions_to_the_Bachmann.E2.80.93Landau_notations
- Big O notation#Family of Bachmann–Landau notations
- ''O''(''b''<sup>2</sup>)
- ''O''(''h'')
- ''O''(''n'' log ''n'')
- ''O''(''n'')
- ''O''(''n''<sup>2</sup>)
- ''O''(''n''<sup>3</sup>)
- ''O''(''n/2'')
- ''O''(1)
- ''O''(log ''i'')
- ''O''(log ''n'')
- ''O''(log(log(''n'')))
- ''Ω''(''n'' log ''n'')
- Asymptotic order
- Big O notation – Orders of common functions
- Big O notation#Big Omega notation
- Big O notation#Little-o notation
- Big O notation#Little-o_notation
- Big O notation#Orders of common functions
- Big Omega
- Big Omega notation
- Big Theta notation
- Big-O notation
- Big_O_notation
- Hardy–Littlewood definition
- Landau symbol
- Landau's Big O notation
- Landau's symbol (Big O notation)
- Little o notation
- O(''C''<sup>3</sup>)
- O(''N'' log ''N'')
- O(''N''log''N'')
- O(''n''<sup>2</sup>)
- O(''n''<sup>2</sup>) complexity
- O(''n''<sup>3</sup>)
- O()
- O(1) complexity
- O(1) time
- O(2<sup>''n''</sup>)
- O(<var>n</var> log<sup>*</sup> <var>n</var>)
- O(log n)
- O(n log n)
- O(n) time
- O(n<sup>2</sup>)
- O, Ω, and Θ notation
- O-estimates
- O-notation
- Small o notation
- \"Big \"
- approximately proportional to
- asymptotic bound
- asymptotic equivalence of functions
- asymptotic lower bound
- asymptotic notation
- asymptotic notations
- asymptotic running time
- asymptotic upper bound
- asymptotically fast
- asymptotically tight bound
- behaves asymptotically as
- big Ω notation
- big ''O'' notation
... and more |