variable -> growing

This commit is contained in:
Vinzent Steinberg 2018-03-01 01:54:41 +01:00
parent f553a06521
commit 87bf71baa4
2 changed files with 3 additions and 3 deletions

View File

@ -1,7 +1,7 @@
# average
Calculate statistics of a sequence iteratively in a single pass, using
constant memory and avoiding numerical problems. The calculations can be
constant space and avoiding numerical problems. The calculations can be
easily parallelized by using `merge`.
[![Documentation Status]][docs.rs]
@ -25,4 +25,4 @@ easily parallelized by using `merge`.
## Related Projects
* [`quantiles`](https://crates.io/crates/quantiles):
Provides quantile estimates with bounded error but using variable memory.
Provides quantile estimates with bounded error but using growing space.

View File

@ -9,7 +9,7 @@ use super::Estimate;
/// Estimate the p-quantile of a sequence of numbers ("population").
///
/// The algorithm uses constant space but does not provide any upper bound on
/// the error. For algorithms that use variable space with bounded error, see
/// the error. For algorithms that use growing space with bounded error, see
/// the [`quantiles`](https://crates.io/crates/quantiles) crate. They are
/// recommended over this algorithm for small samples.
// This uses the P² algorithm introduced here: