gcds
| Crates.io | gcds |
| lib.rs | gcds |
| version | 1.0.0 |
| created_at | 2025-12-30 20:19:29.445855+00 |
| updated_at | 2025-12-30 20:19:29.445855+00 |
| description | Efficient implementations of gcd algorithms |
| homepage | https://github.com/hsang/gcds |
| repository | https://github.com/hsang/gcds |
| max_upload_size | |
| id | 2013247 |
| size | 49,146 |
Hugo (hsanzg)
documentation
README
gcds
This crate implements several algorithms for finding the greatest common divisor of two single-precision numbers.
The greatest common divisor $\gcd(u,v)$ of two integers $u$ and $v$, not both zero, is the largest integer that evenly divides them both. This definition does not apply when $u$ and $v$ are both zero, since every number divides zero; for convenience, all the algorithms adhere to the convention that $\gcd(0,0)=0$.