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