Anonymous user
O: Difference between revisions
m
added an ;Also see (for a Wiki reference).
m (aligned some output.) |
m (added an ;Also see (for a Wiki reference).) |
||
| (One intermediate revision by the same user not shown) | |||
Line 1:
[[Category:Encyclopedia]]
In computer science the notation O(f(n)) is used to denote an upper limit of the asymptotic behavior of an algorithm, usually its complexity in terms of execution time or memory consumption (space). Here ''f'' is a function of ''n'', often a power or logarithm. ''n'' describes the size of the problem. The meaning of O(f(n)) is that the complexity grows with n at most as f(n) does.
Line 19 ⟶ 20:
;Also see:
* Wikipedia: [[https://en.wikipedia.org/wiki/Big_O_notation Big O notation]].
| |||