Packages
lehmer_gcd
v 1.0.2
An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
Dependencies of lehmer_gcd
3 dependencies| Package | Requirement | Status |
|---|---|---|
| binary_gcd | ~> 1.1 | |
| bit_length | ~> 1.0 | |
| nstandard | ~> 0.1 |
