One-pass algorithm

In computing, a one-pass algorithm or single-pass algorithm is a streaming algorithm which reads its input exactly once.[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.[4]

  1. ^ Cite error: The named reference frankfurt was invoked but never defined (see the help page).
  2. ^ Cite error: The named reference sjsu was invoked but never defined (see the help page).
  3. ^ Cite error: The named reference eds was invoked but never defined (see the help page).
  4. ^ Cite error: The named reference pomdp was invoked but never defined (see the help page).