Little o notation/Definition: Difference between revisions

Latest revision as of 18:55, 5 August 2008

Citable Version ^[?]

A definition or brief description of Little o notation.

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

Revision as of 03:41, 5 August 2008 (view source) imported>Alexander Wiebel (def)		Latest revision as of 18:55, 5 August 2008 (view source) imported>Alexander Wiebel (have to look that up again as I am used to a different meaning)
Line 1:		Line 1:
	<noinclude>{{Subpages}}</noinclude>		<noinclude>{{Subpages}}</noinclude>
	Mathematical notation to express various ~~lower~~ bounds concerning asymptotic behaviour of functions, e.g. the complexity of algorithms in computer science.		Mathematical notation to express various bounds concerning asymptotic behaviour of functions, e.g. the complexity of algorithms in computer science.