Greatest Common Divisor (direct step backwards)
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.
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 (2026). Greatest Common Divisor (direct step backwards) (https://in.mathworks.com/matlabcentral/fileexchange/97667-greatest-common-divisor-direct-step-backwards), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Created with
R2021a
Compatible with any release
Platform Compatibility
Windows macOS LinuxTags
Acknowledgements
Inspired: Greatest Common Divisor (direct step backwards) of any 2 nos
Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
| Version | Published | Release Notes | |
|---|---|---|---|
| 3.0.0 |
