gcdint1.m

来自「Mathematical Methods by Moor n Stiling.」· M 代码 · 共 17 行

function g = gcdint1(b,c)
% 
% Compute (only) the GCD (a,b) using the Euclidean algorithm
%
% function g = gcdint1(b,c)
%
% b,c = integers
%
% g = GCD(b,c)

% Copyright 1999 by Todd K. Moon

while(c)
  g = c;
  c = rem(b,c);
  b = g;
end