12. Write a recursive function to implement the recursive algorithm of Exercise 13 (multiplying two positive integers using repeated addition). Also, write a program to test your function.
Write a recursive algorithm to multiply two positive integers m and n using reapeated addition. Specify the base case and the recursive case.
The algorithm is in code in the attached cpp file – function RecMultiply(unsigned int m, unsigned int n) implements the algorithm and main() tests it.
The base case is the multiplication by 0 – then the output is 0.
The recursive case is n > 0: m is added to the product of m and (n-1)
(since the input is supposed to be positive integers, the function always goes through the recursion at least once)
Answer to Exercise 13:
using namespace std;
int RecMultiply(unsigned int m, unsigned int n)
if( 0 == n ) // base case
return 0 ;
// recursive case
return m + RecMultiply(m, n-1) ;
int m, n ;
cin >> m ;
cin >> n ;