November 29, 2016

# Write a C Program to find Product of two Numbers using Recursion

*C Program to find Product of two Numbers*

Write a C Program to find Product of two Numbers using Recursion. Here’s simple Program to find Product of two Numbers using Recursion in C Programming Language.

**Recursion : :**

**Recursion : :**

- Recursion is the process of repeating items in a self-similar way. In programming languages, if a program allows you to call a function inside the same function, then it is called a
of the function.**recursive call**

- The C programming language supports recursion, i.e., a function to call itself. But while using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.

- Recursive functions are very useful to solve many mathematical problems, such as calculating the factorial of a number, generating Fibonacci series, etc.

Below is the source code for C Program to find Product of two Numbers using Recursion which is successfully compiled and run on Windows System to produce desired output as shown below :

**SOURCE CODE : :**

**SOURCE CODE : :**

/* C Program to find Product of two Numbers using Recursion */ #include <stdio.h> int product(int, int); int main() { int a, b, result; printf("Enter two numbers to find their product: "); scanf("%d%d", &a, &b); result = product(a, b); printf("Product of %d and %d is %d\n", a, b, result); return 0; } 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; } }

*Output : :*

****************** OUTPUT ********************** ****************** FIRST RUN ****************** Enter two numbers to find their product: 27 43 Product of 27 and 43 is 1161 ****************** SECOND RUN ****************** Enter two numbers to find their product: 123 321 Product of 123 and 321 is 39483

If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may * Contact Us* through our contact Page or you can also comment below in the comment section.We will try our best to reach upto you in the short interval.

**Thanks for reading the post….**