Revision as of 14:36, 6 February 2012 edit Nazneen Rupawalla (talk \| contribs) 1 edit No edit summary ← Previous edit		Revision as of 14:33, 5 August 2012 edit undo 183.83.20.161 (talk) →Example problems solvable by one-pass algorithms Next edit →
Line 30: * Sort the list according to some order on the symbols (possible since the number of symbols is limited). * Find the maximum gap between two appearances of a given symbol. * http://www.tks.informatik.uni-frankfurt.de/doc/EncycDBS_OnePassAlgos.pdf ==Example problems not solvable by one-pass algorithms==

One-pass algorithm: Difference between revisions