factorial 0.2.1

Convenient methods to compute the factorial, optionally checked.

Coverage
71.43%
5 out of 7 items documented2 out of 7 items with examples
Links
thomwiggers/factorial
10 4 0
Crates.io
Dependencies
- num-traits ^0.2 normal
- num-bigint ^0.3 dev
Versions
- 0.4.0
- 0.3.0
- 0.2.1
- 0.2.0
- 0.1.1
- 0.1.0
Owners

Compute the factorial

This crate provides some convenient and safe methods to compute the factorial naively.

They are not necessarily the fastest versions: there are prime sieve methods that compute the factorial in O(n (log n loglog n)^2) time. Patches are welcome.