gcd
compute the greatest common divisor using euclid's algorithm
- Latest release
- May 21, 2014
- Releases
- 2
- Known CVEs
- 0
- First release
- Aug 12, 2012
- License
- MIT
Repository
Source
- Stars
- —
- Forks
- —
- Open issues
- —
Security score
No OpenSSF Scorecard available for this repository.
Packages from this repo
No other tracked packages from this repository.
Insights
Activity
- Total releases
- 2
- Last 12 months
- 0
- Cadence
- ~1.8 years
- Dependencies
- 0
Releases per month
last 12 monthsRelease mix
- patch 1
2
releases
Dependencies
Depends on
0.0.1No dependencies recorded for the latest release.
Used by
10Releases
| Version | Released | |
|---|---|---|
0.0.1
patch
| ||
0.0.0
initial
|