Q:

Rust program to convert binary to Gray code using recursion

belongs to collection: Rust Functions Programs

YasminRadwan26
Save to bookmark
|
2022-07-18
|
  264 
0

In this program, we will create a recursive function to convert a binary number into gray code and return the result to the calling function.

RUST programming, examples, RUST programming examples,
login and add your own answer to this question

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 convert binary to Gray code using recursion is given below. The given program is compiled and executed successfully.

// Rust program to convert binary 
// to Gray code using recursion

fn bin2gray(n:i32)->i32
{
    if !(n>0)
    {
        return 0;
    }   
    let a:i32 = n % 10;
    let b:i32 = n / 10 % 10;
         
    if (a>0 && !(b>0)) || (!(a>0) && (b>0))        
    {
            return (1 + 10 * bin2gray(n / 10));
    }
 
    return (10 * bin2gray(n / 10));
}

fn main() {
    let num:i32=11011011;
    
    let res = bin2gray(num);

    println!("The Gray codr is {}.",res);
}

Output:

The Gray code is 10110110.

Explanation:

In the above program, we created two functions bin2gray() and main(). The bin2gray() function is a recursive function, which is used to convert a binary number into Gray code and return the result to the calling function.

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

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

total answers (1)

Rust Functions Programs
This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now
<< Rust program to convert an integer number to binar...