Product of 2 Numbers using Recursion Last Updated : 17 Mar, 2025 Comments Improve Suggest changes Like Article Like Report Given two numbers x and y find the product using recursion.Examples : Input : x = 5, y = 2Output : 10Input : x = 100, y = 5Output : 500To find the product of two numbers x and y using recursion, you can use the following approach:Base Case: If y=0, return 0 (since any number multiplied by 0 is 0).Recursive Case: Add x to result and make a recursive call with y as y-1Optimization : Since the number of recursive calls is proportional to y and x * y = y * x, we swap x and y if y is larger than x to reduce the number of recursive calls. C++ // C++ Program to find Product // of 2 Numbers using Recursion #include <bits/stdc++.h> using namespace std; // recursive function to calculate // multiplication of two numbers int product(int x, int y) { // if x is less than // y swap the numbers if (x < y) return product(y, x); // iteratively calculate // y times sum of x else if (y != 0) return (x + product(x, y - 1)); else return 0; } int main() { int x = 5, y = 2; cout << product(x, y); return 0; } Java // Java Program to find Product // of 2 Numbers using Recursion import java.io.*; import java.util.*; class GfG { // recursive function to calculate // multiplication of two numbers static int product(int x, int y) { // if x is less than // y swap the numbers if (x < y) return product(y, x); // iteratively calculate // y times sum of x else if (y != 0) return (x + product(x, y - 1)); else return 0; } public static void main (String[] args) { int x = 5, y = 2; System.out.println(product(x, y)); } } Python # Python3 to find Product of # 2 Numbers using Recursion # recursive function to calculate # multiplication of two numbers def product( x , y ): # if x is less than y swap # the numbers if x < y: return product(y, x) # iteratively calculate y # times sum of x elif y != 0: return (x + product(x, y - 1)) # if any of the two numbers is # zero return zero else: return 0 x = 5 y = 2 print( product(x, y)) C# // C# Program to find Product // of 2 Numbers using Recursion using System; class GfG { // recursive function to calculate // multiplication of two numbers static int product(int x, int y) { // if x is less than // y swap the numbers if (x < y) return product(y, x); // iteratively calculate // y times sum of x else if (y != 0) return (x + product(x, y - 1)); // if any of the two numbers is // zero return zero else return 0; } public static void Main () { int x = 5, y = 2; Console.WriteLine(product(x, y)); } } JavaScript // JavaScript program to find Product // of 2 Numbers using Recursion // recursive function to calculate // multiplication of two numbers function product(x, y) { // if x is less than // y swap thenumbers if (x < y) return product(y, x); // iteratively calculate // y times sum of x else if (y != 0) return (x + product(x, y - 1)); // if any of the two numbers is // zero return zero else return 0; } // Driver Code let x = 5; let y = 2; console.log(product(x, y)); Output10Time Complexity: O(min(x,y))Auxiliary Space: O(min(x,y)), The extra space is used in the recursive call stack. Comment More infoAdvertise with us Next Article Product of 2 Numbers using Recursion S Shahnawaz_Ali Follow Improve Article Tags : Misc Recursion DSA Basic Coding Problems Practice Tags : MiscRecursion Similar Reads Introduction to Recursion The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution 14 min read What is Recursion? Recursion is defined as a process which calls itself directly or indirectly and the corresponding function is called a recursive function.Example 1 : Sum of Natural Numbers Let us consider a problem to find the sum of natural numbers, there are several ways of doing that but the simplest approach is 8 min read Difference between Recursion and Iteration A program is called recursive when an entity calls itself. A program is called iterative when there is a loop (or repetition).Example: Program to find the factorial of a number C++ // C++ program to find factorial of given number #include<bits/stdc++.h> using namespace std; // ----- Recursion 6 min read Types of Recursions What is Recursion? The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. Using recursive algorithm, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inord 15+ min read Finite and Infinite Recursion with examples The process in which a function calls itself directly or indirectly is called Recursion and the corresponding function is called a Recursive function. Using Recursion, certain problems can be solved quite easily. Examples of such problems are Towers of Hanoi (TOH), Inorder/Preorder/Postorder Tree Tr 6 min read What is Tail Recursion Tail recursion is defined as a recursive function in which the recursive call is the last statement that is executed by the function. So basically nothing is left to execute after the recursion call.For example the following function print() is tail recursive.C++// An example of tail recursive funct 7 min read What is Implicit recursion? What is Recursion? Recursion is a programming approach where a function repeats an action by calling itself, either directly or indirectly. This enables the function to continue performing the action until a particular condition is satisfied, such as when a particular value is reached or another con 5 min read Why is Tail Recursion optimization faster than normal Recursion? What is tail recursion? Tail recursion is defined as a recursive function in which the recursive call is the last statement that is executed by the function. So basically nothing is left to execute after the recursion call. What is non-tail recursion? Non-tail or head recursion is defined as a recur 4 min read Recursive Functions A Recursive function can be defined as a routine that calls itself directly or indirectly. In other words, a recursive function is a function that solves a problem by solving smaller instances of the same problem. This technique is commonly used in programming to solve problems that can be broken do 4 min read Difference Between Recursion and Induction Recursion and induction are fundamental ideas in computer science and mathematics that might be regularly used to solve problems regarding repetitive structures. Recursion is a programming technique in which a function calls itself to solve the problem, whilst induction is a mathematical proof techn 4 min read Like