Big O notation/Definition

From Citizendium
< Big O notation
Revision as of 03:42, 5 August 2008 by imported>Alexander Wiebel (def)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
A definition or brief description of Big O notation.

Mathematical notation to express various upper bounds concerning asymptotic behaviour of functions, e.g. the complexity of algorithms in computer science.