Binary Greatest Common Divisor, Part 2
This program finds the gcd using the binary gcd algorithm as laid out at https://www.di-mgt.com.au/euclidean.html#code-binarygcd
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
This program finds the greatest common divisor using the binary gcd algorithm as laid out at https://www.di-mgt.com.au/euclidean.html#code-binarygcd
Cite As
Ben Mimay (2026). Binary Greatest Common Divisor, Part 2 (https://www.mathworks.com/matlabcentral/fileexchange/74547-binary-greatest-common-divisor-part-2), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.4 (1.44 KB)
MATLAB Release Compatibility
- Compatible with R2015b to R2019b
Platform Compatibility
- Windows
- macOS
- Linux
