Content deleted Content added
Remove text on cluster representatives. It's specific to databases, and the mechanics are covered under streaming algorithm |
→Example problems not solvable by one-pass algorithms: Add example of a problem that can be solved in two passes but not one. |
||
Line 31:
* Find the [[mode (statistics)|modes]] (This is not the same as finding the most frequent symbol from a limited alphabet).
* Sort the list.
* Count the number of items greater than or less than the average. However, this can be done in constant memory with two passes: Pass 1 find the average and pass 2 does the counting. This two-pass algorithm is a [[streaming algorithm]] but not a one-pass algorithm.
== References==
| |||