gcds 1.0.0

Efficient implementations of gcd algorithms
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

# gcds

[![Crates.io](https://img.shields.io/crates/v/gcds)](https://crates.io/crates/gcds)
[![docs.rs](https://img.shields.io/docsrs/gcds)](https://docs.rs/gcds)
[![Build status](https://github.com/hsanzg/gcds/actions/workflows/test.yml/badge.svg)](https://github.com/hsanzg/gcds/actions/)

<!-- The following section is autogenerated by the cargo-sync-readme utility;
     to modify its contents, update the crate documentation in the `src/lib.rs`
     file and run the `cargo sync-readme` command. -->

<!-- cargo-sync-readme start -->

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$.

<!-- cargo-sync-readme end -->

## License

[MIT](LICENSE) &copy; [Hugo Sanz González](https://hgsg.me)