1 Answers
In computing, a one-pass algorithm or single-pass algorithm is a streaming algorithm which reads its input exactly once. It does so by processing items in order, without unbounded buffering; it reads a block into an input buffer, processes it, and moves the result into an output buffer for each step in the process. A one-pass algorithm generally requires O time and less than O storage ], where n is the size of the input. An example of a one-pass algorithm is the Sondik partially observable Markov decision process.
4 views
Answered