Question

PROBLEM: Write a recursive method named Division that takes two integers X and Y returns the result of integer division (i.e., 8 / 3 = 2). Please comment on every line of code.

EXISITNG CODE:

int Exponentiation(int X, int Y) {
    if (Y == 0) // base case
        return 1;
    else    // recursive case
        return X * Exponentiation(X, Y - 1);    //make recursive call
}

int Multiply(int X, int Y){
    if(Y == 0){
        return 0;
    }
    else{
        return X + Multiply(X, Y-1);
    }
}

int MultiplyRange(int X, int Y){
    if(Y == 0){
        return 0; 
    }
    else{
        return X + MultiplyRange(X, Y-1);
    }
}

int Subtraction(int X, int Y) {
    if (Y == 0) // base case
        return X;
    else    // recursive case
        return Subtraction(X, Y - 1) - 1;    //make recursive call
}

int Addition(int X, int Y) {
    if (Y == 0) // base case
        return X;
    else    // recursive case
        return 1 + Addition(X, Y - 1);    //make recursive call
}

int AddToN(int n) {
    if (n == 0) {   // base case
        return 0;
    } else { // recursive case
        return n + AddToN(n-1); //make recursive call
    }
}

void printStars (int n)

{

if (n==0 ) {

//base case
cout <<"";

}

else{

printStars(n-1);
cout << "";
}

}

}

int sumRange ( int min, int max)

{

if (min == max){
//base case

return min;
}

else{
//recursive case

return max + sumRange(min,max-1);

}

}

}

int sumDigits(int n)

{

int rightDigit = n%10;

int remainDigits = n / 10;

if(n < 10)

{

// Base case

return n;

}

else

{

return sumDigits(remainDigits) + rightDigit;

}

}

Answer 1

#include <iostream>

using namespace std;

int Division(int X, int Y) {
    if (X < Y) // base case
        return 0;
    else    // recursive case
        return 1 + Division(X-Y, Y);    //make recursive call
}

int main() {
    cout << Division(8, 3) << endl;  // prints 2
    return 0;
}

Please upvote this answer. Let me know if you have doubts..