Big O notation
Big O notation is a mathematical notation that describes the approximate size of a function on a domain. Big O is a member of a family of notations invented by German mathematicians Paul Bachmann and Edmund Landau and expanded by others, collectively called Bachmann–Landau notation. The letter O was chosen by Bachmann to stand for Ordnung, meaning the order of approximation.
Big O notation - Wikipedia Jump to content From Wikipedia, the free encyclopedia Describes approximate behavior of a function Fit approximation Concepts Orders of approximation Scale analysis Big O notation Curve fitting False precision Significant figures Other fundamentals Approximation Generalization error Taylor polynomial Scientific modelling v t e Big O notation is a mathematical notation that describes the approximate size of a function on a domain . Big O is a member of a family of notations invented by the German mathematicians Paul Bachmann [ 1 ] and Edmund Landau [ 2 ] and expanded
related reading
- Big Osamwho.dev
- Big O Cheat Sheet – Time Complexity Chartfreecodecamp.org
- Big-O Algorithm Complexity Cheat Sheet (Know Thy Complexities!) @ericdrowellbigocheatsheet.com
- Kolmogorov–Arnold representation theorem - Wikipediaen.wikipedia.org
- Law of large numbers - Wikipediaen.wikipedia.org
- Mathematical optimization - Wikipediaen.wikipedia.org
- Math & Engineeringxn--2-umb.com
- GitHub - Experience-Monks/math-as-code: a cheat-sheet for mathematical notation in code formgithub.com
- Memory access is O(N^[1/3])vitalik.eth.limo
- Chaitin's constant - Wikipediaen.wikipedia.org
- Who Can Name the Bigger Number?scottaaronson.com
- Arithmetical hierarchy - Wikipediaen.wikipedia.org