[1] 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.
[2] A one-pass algorithm generally requires O(n) (see 'big O' notation) time and less than O(n) storage (typically O(1)), where n is the size of the input.
[3] An example of a one-pass algorithm is the Sondik partially observable Markov decision process.
Given any list as an input: Given a list of numbers: The two-pass algorithms above are still streaming algorithms but not one-pass algorithms.
This computer science article is a stub.