Greatest Common Divisor (direct step backwards) of any 2 nos
Without using any arrays, the direct method of finding GCD is implemented by while loop for any two numbers.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
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) of any 2 nos (https://se.mathworks.com/matlabcentral/fileexchange/97672-greatest-common-divisor-direct-step-backwards-of-any-2-nos), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired by: Greatest Common Divisor (direct step backwards)
General Information
- Version 3.0.0 (1.24 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 3.0.0 |
