Content deleted Content added
computer sci stub -> category algorithms |
2nd try, delete cat computing |
||
Line 1:
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.
===Example problems solvable by one-pass algorithms===
| |||