Product of 2 Numbers using Recursion

Given two number x and y find product using recursion.

Examples :

Input : x = 5, y = 2
Output : 10

Input : x = 100, y = 5
Output : 500

Method
1) If x is less than y, swap the two variables value
2) Recursively find y times the sum of x
3) If any of them become zero, return 0

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// 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));
  
    // if any of the two numbers is 
    // zero return zero
    else
        return 0;
}
  
// Driver Code
int main()
{
    int x = 5, y = 2;
    cout << product(x, y);
    return 0;
}

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// 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));
      
        // if any of the two numbers is 
        // zero return zero
        else
            return 0;
    }
      
    // Driver Code
    public static void main (String[] args)
    {
        int x = 5, y = 2;
        System.out.println(product(x, y)); 
    }
}
  
// This code is contributed by Gitanjali.

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# 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
  
# Driver code
x = 5
y = 2
print( product(x, y))
  
# This code is contributed
# by Abhishek Sharma44.

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// 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;
    }
      
    // Driver code
    public static void Main ()
    {
        int x = 5, y = 2;
        Console.WriteLine(product(x, y)); 
    }
}
  
// This code is contributed by vt_m.

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP 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
$x = 5; $y = 2;
echo(product($x, $y));
  
// This code is contributed by Ajit.
?>

chevron_right



Output :

10


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.



Improved By : jit_t



Article Tags :
Practice Tags :


2


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.