Small Rust library for calculating greatest common divisor crates.io/crates/gcd
0
fork

Configure Feed

Select the types of activity you want to include in your feed.

Specify we don't require std via #![no_std]

+2
+2
src/lib.rs
··· 1 + #![no_std] 2 + 1 3 pub trait Gcd { 2 4 /// Determine [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor) 3 5 /// using the [Euclidean algorithm](https://en.wikipedia.org/wiki/Euclidean_algorithm)