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

Version 3.0.0 (1,24 ko) par 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 téléchargements
Mise à jour 15 août 2021

Afficher la licence

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

Citation pour cette source

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. Récupéré le .

Compatibilité avec les versions de MATLAB
Créé avec R2021a
Compatible avec toutes les versions
Plateformes compatibles
Windows macOS Linux
Remerciements

Inspiré par : 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 Publié le Notes de version
3.0.0