Rust program to calculate the GCD using recursion

belongs to collection: Rust Functions Programs

YasminRadwan26

Save to bookmark

2022-07-18

256

In this program, we will create a recursive function to calculate the GCD and return the result to the calling function.

RUST programming, examples, RUST programming examples,

All Answers

YasminRadwan26

2022-07-18

need an explanation for this answer? contact us directly to get an explanation for this answer

Program/Source Code:

The source code to calculate the GCD using recursion is given below. The given program is compiled and executed successfully.

// Rust program to calculate 
// the GCD using recursion

fn calculateGCD(a:i32, b:i32)->i32
{
    while (a != b)
    {
        if (a > b)
        {
            return calculateGCD(a - b, b);
        }
        else
        {
            return calculateGCD(a, b - a);
        }
    }
    
    return a;
}

fn main() {
    let a:i32=45;
    let b:i32=75;
        
    let res = calculateGCD(a, b);
    println!("The GCD of {0} and {1} is {2}.", a, b, res);
}

Output:

The GCD of 45 and 75 is 15.

Explanation:

In the above program, we created two functions calculateGCD() and main(). The calculateGCD() function is a recursive function, which is used to calculate the GCD of two numbers and return the result to the calling function.

In the main() function, we called the calculateGCD() function and printed the result.

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)