Content deleted Content added
Angus Lepper (talk | contribs) m 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. |
cat |
||
Line 1:
In computing, a '''one-pass algorithm''' is one which reads its input exactly once, in order, without [[Buffer|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.
[[Category:Computing]]
{{stub}}
| |||