Greatest Common Divisor (direct step backwards) of any 2 nos

Version 3.0.0 (1.24 KB) by Sambit Supriya Dash
Without using any arrays, the direct method of finding GCD is implemented by while loop for any two numbers.
0.0
(0)
3 Downloads
Updated 15 Aug 2021

View License

Much simpler and showman's way of GCD technique is implemented through while looping by avoiding any kind of arrays, sorting or selecting.

Cite As

Sambit Supriya Dash (2024). Greatest Common Divisor (direct step backwards) of any 2 nos (https://www.mathworks.com/matlabcentral/fileexchange/97672-greatest-common-divisor-direct-step-backwards-of-any-2-nos), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2021a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Acknowledgements

Inspired by: Greatest Common Divisor (direct step backwards)

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Version Published Release Notes
3.0.0