pub fn gcd<T: Integer>(a: T, b: T) -> T
Computes the greatest common divisor (GCD) using the Euclidean algorithm.
assert_eq!(gcd(252, 105), 21); assert_eq!(gcd(-12, 8), -4);