One-pass algorithm: Difference between revisions

Revision as of 09:06, 23 January 2013

Revision as of 19:54, 18 February 2014

Line 1:

{{Unreferenced|date=January 2007}}

{{orphan|date=November 2009}}

In computing, a '''one-pass algorithm''' is one which reads its input exactly once, in order, without unbounded [[Buffer (computer science)|buffering]]. A one-pass algorithm generally requires O(n) (see [[Big O Notation|'big O' notation]]) time and less than O(n) storage (typically O(1)), where n is the size of the input.