Cody

Problem 42966. find "greatest common divisor" of two integer value

Solution 2971765

Submitted on 20 Sep 2020 by Benjamin
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
x = -18; y=96; z_correct = 6; assert(isequal(your_GCD(x,y),z_correct)) x = -118; y=66; z_correct = 2; assert(isequal(your_GCD(x,y),z_correct))

Suggested Problems

More from this Author2

Community Treasure Hunt

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

Start Hunting!