C# Program to Find Product of 2 Numbers Using Recursion
Last Updated :
19 Oct, 2021
Given two numbers x and y find the product using recursion. Recursion is a process in which a function calls itself directly or indirectly and the corresponding function is known as a recursive function. It is used to solve problems easily like in this article using recursion we will find the product of two numbers.
Examples:
Input : x = 10, y = 3
Output : 30
Input : x = 70, y = 4
Output : 280
Approach:
To print the product of two number using recursion follow the following steps:
- For our task we have two numbers, i.e., x, y.
- Initialize a variable result with value zero.
- Recursively add the x to result for y times.
- Take the base condition as y == 0. When y is equal to 0 then return from function.
- At The end of iteration the result variable will contain the product of x, y.
Example:
C#
using System;
class GFG{
static int product( int x, int y)
{
if (y == 0)
return 0;
else
return (x + product(x, y - 1));
}
public static void Main ()
{
int x = 10, y = 3;
Console.Write(product(x, y));
}
}
|
We can optimize this code by swapping the x and y if y is greater than x. Lets us assume that x = 3 and y = 150 if we follow the above program then the x is added recursively 150 times, but by swapping x,y (i.e. x = 150, y = 3) we only need to add x recursively 3 times.
C#
using System;
class GFG{
static int product( int x, int y)
{
if (y == 0)
return 0;
else
return (x + product(x, y - 1));
}
public static void Main()
{
int x = 3, y = 150;
if (x < y)
Console.Write(product(y, x));
else
Console.Write(product(x, y));
}
}
|
Share your thoughts in the comments
Please Login to comment...