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

Version 3.0.0 (1,24 KB) von 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
Aktualisiert 15. Aug 2021

Lizenz anzeigen

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

Zitieren als

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

Kompatibilität der MATLAB-Version
Erstellt mit R2021a
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Tags Tags hinzufügen
Quellenangaben

Inspiriert von: 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 Veröffentlicht Versionshinweise
3.0.0