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) time and less than O(N) storage (typically O(1)), where N is the size of the input.
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) 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. |