Editing O(1) scheduler (section)

== About O(1) notation ==
{{Main|Big O notation}}
An [[algorithm]] operates over an input, and the size of that input usually determines its running time. [[Big O notation]] is used to denote the growth rate of an algorithm's execution time based on the amount of input. For example, the running time of an O(n) algorithm increases linearly as the input size n grows.<ref>{{cite web
|author = dws
|url = http://www.perlmonks.org/?node_id=227909
|title = An informal introduction to O(N) notation
|access-date = 2014-09-09
}}</ref> The running time of an [[Big O notation#Orders of common functions|O(n{{sup|2}})]] algorithm grows [[quadratic time|quadratically]]. If it is possible to establish a constant upper bound on the running time of an algorithm, it is considered to be O(1) (one might say it runs in "constant time"). That is, an O(1) algorithm is guaranteed to complete in a certain amount of time regardless of the size of the input.<ref>{{cite web
|author = Rob Bell
|url = http://rob-bell.net/2009/06/a-beginners-guide-to-big-o-notation/
|title = A Beginner's Guide to Big O Notation
|access-date = 2014-09-09
}}</ref>