One-pass Algorithm

Example problems solvable by one-pass algorithms

Given any list as an input:

Find the ''n''th element (or report that the list has fewer than ''n'' elements).

Find the ''n''th element from the end (or report that the list has fewer than ''n'' elements).

Given a list of numbers:

Find the Sum , Mean , Variance and Standard Deviation of the elements of the list.

Given a list of symbols from an alphabet of ''k'' symbols, given in advance.

Sort the list according to some order on the symbols (possible since the number of symbols is limited).

Example problems not solvable by one-pass algorithms

Given any list as an input:

Given a list of numbers:

Find the Mode s (This is not the same is finding the most frequent symbol from a limited alphabet).

	CATEGORIES ABOUT ONE-PASS ALGORITHM

	computing

Information About