Function libslide::math::gcd::gcd

pub fn gcd<N: Unsigned + PrimInt>(u: N, v: N) -> N

Calculates the GCD for (u, v) ∈ (Z, Z).

Currently, a binary GCD method is used as an underlying implementation.

binary_gcd              time:   [2.4969 ns 2.5894 ns 2.6641 ns]

euclidean_gcd           time:   [2.8543 ns 2.8948 ns 2.9257 ns]