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

版本 3.0.0 (1.2 KB) 作者: 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.0 次下载
更新时间 2021/8/15

查看许可证

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

引用格式

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. 检索来源 .

MATLAB 版本兼容性
创建方式 R2021a
兼容任何版本
平台兼容性
Windows macOS Linux

Community Treasure Hunt

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

Start Hunting!

版本 已发布 发行说明
3.0.0