Related articles:
Algorithm
Quicksort
Bubble sort
Fast Fourier transform
Heapsort
Kd-tree
Integer factorization
Priority queue
Merge sort
Shell sort
Dynamic programming
Analysis of algorithms
Ackermann function
Donald Knuth
Computational complexity theory
Factorial
Taylor series
Logarithm
Theta
Determinant
Omicron
Hash table
Insertion sort
Key terms:
o
notation
algorithm
mbox
asymptotic
grows
infty
paul e
big o notation
mnemonic
log n
cg
forall
computer science
hbox
polynomial
growth rate
formal definition
landau
if and only if
big theta
retrieved december
equals sign
time complexity
grows at a rate
algorithms and data structures
national institute of standards
dictionary of algorithms and data
abuse of notation
institute of standards and technology
asymptotic notation
sufficiently large input parameter
we say
exists m
implies f
more slowly than
iff
used in computer science
analysis of algorithms
algorithm runs in the order
subseteq o
rate that may henceforth
greek letters
forall n
forall m
donald knuth
grows asymptotically as fast
multiple variables
number of steps
exists c
Search external links cited by footnotes on Wikipedia page Big O notation:
|
|