A static website using pure JavaScript for extended euclidean algorithm calculation.
-
Updated
Sep 1, 2021 - JavaScript
A static website using pure JavaScript for extended euclidean algorithm calculation.
Finds the GCD using the euclidean algorithm or finds a linear combination of the GCD using the extended euclidean algorithm with all steps/work done shown
Euclid's greatest common divisor algorithm as a JavaScript component and npm package
Add a description, image, and links to the gcd-calculator topic page so that developers can more easily learn about it.
To associate your repository with the gcd-calculator topic, visit your repo's landing page and select "manage topics."