Java:实现两个数字的GCD最大公约数的实现算法（附完整源码）

package com.williamfiset.algorithms.math;

public class GCD {
   

  // Computes the Greatest Common Divisor (GCD) of a & b
  // This method ensures that the value returned is non negative
  public static long gcd(long a
1
2
3
4
5
6
7
8