Euclidean algorithm for computing greatest common divisor in rust

gcd.rs

use num::traits::{Zero, Rem};

fn gcd<T>(a: T, b: T) -> T
where
    T: Zero + Rem<Output = T> + std::cmp::PartialEq + Copy,
{
    if b == T::zero() {
        return a;
    }
    gcd(b, a % b)
}