[Data Structure learning] Euclidean algorithm c ++ realize

oujilide int (int m, int n) {
 int r;
 r = m - (m / n) * n; // this is to take the floor directly divider
 if (r == 0)
  return  n;
 else {
  m = n;
  n = r;
  //m置n,n置r
  return oujilide(m,n);
 }
}

Guess you like

Origin www.cnblogs.com/cyber-shady/p/11520593.html