Question

C++ only Write a function decimalToBinaryRecursive that converts a decimal value to binary using recursion. This function takes a single parameter, a non-negative integer, and returns a string corresponding to the binary representation of the given value.

• Your function should be named decimalToBinaryRecursive
• Your function should take a single argument
  • An integer to be converted to binary
• Your function should not print anything
• Your function should use recursion instead of a loop. Note that if you try to use a loop, your code will get an error message.
• Your function should return the binary representation of the given value as a string.

For Example:

• decimalToBinaryRecursive(0) should return "0"
• decimalToBinaryRecursive(1) should return "1"
• decimalToBinaryRecursive(8) should return "1000"

don't use this code as part of the answer

  string s = d == 0 ? "0" : "1";

Answer 1

#include <iostream>
#include <string>
using namespace std;

string decimalToBinaryRecursive(int n) {
    if(n == 0) {
        return "0";
    } else if(n == 1) {
        return "1";
    } else {
        int d = n % 2;
        string s;
        if (d == 0) {
            s = "0";
        } else {
            s = "1";
        }
        return decimalToBinaryRecursive(n/2) + s;
    }
}

int main() {
    cout << decimalToBinaryRecursive(0) << endl;
    cout << decimalToBinaryRecursive(1) << endl;
    cout << decimalToBinaryRecursive(8) << endl;
    return 0;
}