这是《The Art of Computer Programming》的习题1.1.3： Change Algorithm E(for the sake of effciency) so that all trivial replacement operations such as "m <- n" are avoided. Write this new algorithm in the sty

算法描述： Given two positive integers m and n, find their greatest common divisor, that is, the largest positive integer that evenly divides both m and n. E1.[Find remainder.] Divide m by n and let r be