Write functions that is a recursive version of following two functions: 1). int

Question

Write functions that is a recursive version of following two functions:

1).

int checkPrimeNumber(int number) {
bool num = false;
int i=2;
while (i <= number/2) {
if (number%i == 0) {
num = true;
break;
}
++i;
}
return num;

}

2).

void multiplicationTable(int number) {

for(int i=1; i<=12; i++) {

cout<< " " <<number<< " * " << i << " = "<< i * number << endl;

}

}

Explanation / Answer

1) int checkPrimeNumber(int number, int i) { if(i > number/2) { return false; } else if(number % i == 0) { return true; } else { return checkPrimeNumber(number, i+1); } } // and this is called like // checkPrimeNumber(number, 2); 2) void multiplicationTable(int number, int i) { if(i > 0) { multiplicationTable(number, i-1); cout

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.