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

Versione 3.0.0 (1,24 KB) da 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 download
Aggiornato 15 ago 2021

Visualizza la licenza

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

Cita come

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. Recuperato .

Compatibilità della release di MATLAB
Creato con R2021a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux

Community Treasure Hunt

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

Start Hunting!

Versione Pubblicato Note della release
3.0.0