Cody

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

Solution 2778913

Submitted on 4 Aug 2020 by Ramesh Kumar V
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))

len = 1 n1 = 18 n2 = 96 n1 = 9 n2 = 48 len = 2 x = 3 3 y = 2 2 2 2 3 xy = 3 len = 1 n1 = 118 n2 = 66 n1 = 59 n2 = 33 len = 2 x = 59 y = 3 11 xy = 1×0 empty double row vector

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!