big_o

Infers asymptotic computational complexity.

big_o helps to estimate computational complexity of algorithms by inspecting measurement data (eg. execution time, memory consumption, etc). Users are expected to provide measurement data, big_o will try to fit a set of complexity models and return the best fit.

Example

```rust use assertapproxeq::assertapproxeq;

// f(x) = gain * x ^ 2 + offset let data = vec![(1., 1.), (2., 4.), (3., 9.), (4., 16.)];

let (complexity, all) = bigo::infer_complexity(data).unwrap();

asserteq!(complexity.name, bigo::Name::Quadratic); asserteq!(complexity.notation, "O(n^2)"); assertapproxeq!(complexity.params.gain.unwrap(), 1.0, 1e-6); assertapproxeq!(complexity.params.offset.unwrap(), 0.0, 1e-6); assert!(complexity.rank < bigo::complexity("O(n^3)").unwrap().rank); ```