Jump to content

One-pass algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Angus Lepper (talk | contribs) at 19:22, 4 January 2007 (Tidied, also added link to big O notation as not all readers will have come across it. Lowercase N seems to be more standard than uppercase, but perhaps this is stylistic rather than anything.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=One-pass_algorithm&oldid=98470314"