fn gcd(mut a: u32, mut b: u32) -> u32 {
    while b != 0 {
        let r = a % b;
        a = b;
        b = r;
    }
    a
}
/// Determine the [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor)
///
/// This function is based on the [Euclidean algorithm](https://en.wikipedia.org/wiki/Euclidean_algorithm).
Determine the [greatest common divisor]
This function is based on the [Euclidean algorithm].
Determine the [ greatest common divisor ] This function is based on the [ Euclidean algorithm ] .
fn gcd(mut a: u32, mut b: u32) -> u32 {
    while b != 0 {
        let r = a % b;
        a = b;
        b = r;
    }
    a
}
fn gcd ( mut a : u32 , mut b : u32 ) -> u32 { while b != 0 { let r = a % b ; a = b ; b = r ; } a }
Determine the [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor)
This function is based on the [Euclidean algorithm](https://en.wikipedia.org/wiki/Euclidean_algorithm).
Determine the [ greatest common divisor ] ( https : // en . wikipedia . org / wiki / Greatest_common_divisor ) This function is based on the [ Euclidean algorithm ] ( https : // en . wikipedia . org / wiki / Euclidean_algorithm ) .
a
u32
b
u32
a
u32
b
u32