September 13, 2010

Recursive Multiplication C++

By Mohammed Abualrob Algorithms and Data Structures 0 Comments

Problem

Write a recursive function to compute the product of two positive integers.

Solution

The product of two positive integers (A*B) is nothing but the sum of the first integer (A), (B) times

Code

Here is the code in C++

//Includes
#include <iostream>

//STD
using namespace std;

float RecursiveProduct(int a, int b)
{	
	//Base case
	if (a == 0 || b == 0)
	{
		return 0;
	}
	if (b == 1)
	{
		return a;
	}
	return a + RecursiveProduct(a, b-1);
}

//Main function
void main()
{
	cout << RecursiveProduct(3, 4) << endl;
}

//Includes

#include <iostream>

//STD

using namespace std;

float RecursiveProduct(int a, int b)

{

//Base case

if (a == 0 || b == 0)

{

return 0;

}

if (b == 1)

{

return a;

}

return a + RecursiveProduct(a, b-1);

}

//Main function

void main()

{

cout << RecursiveProduct(3, 4) << endl;

}

8 BIT AVENUE

Recursive Multiplication C++

More from my site

About Author

Mohammed Abualrob

Add a Comment