Revision as of 23:03, 14 April 2021 edit Dmh (talk \| contribs) 12 edits Note that finding the middle element is also two-pass ← Previous edit		Revision as of 05:05, 15 April 2021 edit undo Lollipoplollipoplollipop (talk \| contribs) Extended confirmed users, IP block exemptions 21,175 edits m →Example problems solvable by one-pass algorithms Tag: 2017 wikitext editor Next edit →
Line 14: Given a list of numbers: * Find the ''k'' largest or smallest elements, ''k'' given in advance. * Find the [[summation\|sum]], [[mean]], [[variance]] and [[standard deviation]] of the elements of the list. See also [[~~Algorithms_for_calculating_variance~~Algorithms for calculating_variance]]. Given a list of symbols from an alphabet of ''k'' symbols, given in advance.

One-pass algorithm: Difference between revisions