Packages
An efficient Elixir implementation of the binary GCD algorithm (Stein's algorithm) for computing the greatest common divisor (GCD) of two or more non-negative integers using only bitwise operations and subtraction.
Current section
1 Dependant
Jump to
Current section
1 Dependant
Packages depending on binary_gcd
1 package-
An efficient implementation of the Lehmer GCD algorithm for computing the greatest common divisor of large integers in Elixir.
Updated 10 months ago
69recent downloads
1
package of
1
total
