C# Program to Find Product of Two Numbers using Recursion

This is a C# Program to find Product of 2 numbers using recursion.

This C# Program finds Product of 2 Numbers using Recursion.

Here the multiples of 3 and 5 are found and the sum of all the multiples are calculated and are displayed.

Here is source code of the C# Program to find Product of 2 Numbers using Recursion. The C# program is successfully compiled and executed with Microsoft Visual Studio. The program output is also shown below.

/*
 * C# Program to find Product of 2 Numbers using Recursion
 */
using System;
class program
{
    public static void Main()
    {
        int a, b, result;
        Console.WriteLine("Enter two numbers to find their product: ");
        a = int.Parse(Console.ReadLine());
        b = int.Parse(Console.ReadLine());
        prog pg = new prog();
        result = pg.product(a, b);
        Console.WriteLine("Product of {0} and {1} is {2}",a, b, result);
        Console.ReadLine();
    }
}
class prog
{
    public int product(int a, int b)
    {
        if (a < b)
        {
            return product(b, a);
        }
        else if (b != 0)
        {
            return (a + product(a, b - 1));
        }
        else
        {
            return 0;
        }
    }
}

In this C# program, we are reading two numbers using ‘a’ and ‘b’ variables respectively. Using ‘result’ variable we are calling product() function by passing the value of ‘a’ and ‘b’ variables as an argument.

Then product() function is used to find the multiples of 3 & 5 and the sum of all the multiples are calculated and are printed.

 
Enter two numbers to find their product:
5
6
Product of 5 and 6 is 30