Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Big O notation
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== See also == * [[Asymptotic computational complexity]] * [[Asymptotic expansion]]: Approximation of functions generalizing Taylor's formula * [[Asymptotically optimal algorithm]]: A phrase frequently used to describe an algorithm that has an upper bound asymptotically within a constant of a lower bound for the problem * [[Big O in probability notation]]: ''O<sub>p</sub>'', ''o<sub>p</sub>'' * [[Limit inferior and limit superior]]: An explanation of some of the limit notation used in this article * [[Master theorem (analysis of algorithms)]]: For analyzing divide-and-conquer recursive algorithms using big O notation * [[Nachbin's theorem]]: A precise method of bounding [[complex analytic]] functions so that the domain of convergence of [[integral transform]]s can be stated * [[Order of approximation]] * [[Order of accuracy]] * [[Computational complexity of mathematical operations]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)