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

Versión 3.0.0 (1,24 KB) por 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 descargas
Actualizado 15 ago 2021

Ver licencia

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

Citar como

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

Compatibilidad con la versión de MATLAB
Se creó con R2021a
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Agradecimientos

Inspirado por: 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!

Versión Publicado Notas de la versión
3.0.0