Content deleted Content added
Dmh~enwiki (talk | contribs) Stub. There doesn't seem to be an entry for this. |
Dmh~enwiki (talk | contribs) m Stub. There doesn't seem to be an entry for this. |
||
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) time and less than O(N) storage (typically O(1)), where N is the size of the input.
{{stub}}
| |||