Big O notation/Definition: Difference between revisions
Jump to navigation
Jump to search
imported>Alexander Wiebel (New page: <noinclude>{{Subpages}}</noinclude> Mathematical notation to express various bounds concerning asymptotic behaviour of functions, e.g. the complexity of algorithms in computer science.) |
imported>Alexander Wiebel (def) |
||
| Line 1: | Line 1: | ||
<noinclude>{{Subpages}}</noinclude> | <noinclude>{{Subpages}}</noinclude> | ||
Mathematical notation to express various bounds concerning asymptotic behaviour of functions, e.g. the complexity of algorithms in computer science. | Mathematical notation to express various upper bounds concerning asymptotic behaviour of functions, e.g. the complexity of algorithms in computer science. | ||
Latest revision as of 04:42, 5 August 2008
Mathematical notation to express various upper bounds concerning asymptotic behaviour of functions, e.g. the complexity of algorithms in computer science.