Rust program to calculate the HCF using recursion

belongs to collection: Rust Functions Programs

YasminRadwan26

Save to bookmark

2022-07-18

262

In this program, we will create a recursive function to calculate the HCF 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 HCF using recursion is given below. The given program is compiled and executed successfully.

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

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

fn main() {
    let a:i32=36;
    let b:i32=48;
        
    let res = calculateHCF(a, b);
    println!("The HCF of {0} and {1} is {2}.", a, b, res);
}

Output:

The HCF of 36 and 48 is 12.

Explanation:

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

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

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

total answers (1)