Program to Find Factorial of Number Using Recursion
- Write a program to Find Factorial of Number Using Recursion in C
- Write a program to Find Factorial of Number Using Recursion in C++
- Write a program to Find Factorial of Number Using Recursion in Python
- Write a program to Find Factorial of Number Using Recursion in PHP
- Write a program to Find Factorial of Number Using Recursion in Java
- Write a program to Find Factorial of Number Using Recursion in Java Script
- Write a program to Find Factorial of Number Using Recursion in C#
Explanation:
By continually multiplying the current number by the factorial of the number decremented by 1 until we reach the base case, we may use recursion to calculate the factorial of an integer.
Logic to Find Factorial Using Recursion
- Base Case:
- If the number is 0 or 1, the factorial is 1. This is the stopping condition for recursion.
- Recursive Case:
- For a number n, its factorial is n*factorial(n – 1).
Program to Find Factorial of Number Using Recursion
-
C
-
C++
-
Python
-
PHP
-
JAVA
-
Java Script
-
C#
#include <stdio.h> int factorial(int n) { if (n == 0 || n == 1) { return 1; } return n * factorial(n - 1); } int main() { int num; printf("Enter a number: "); scanf("%d", &num); printf("Factorial of %d = %d\n", num, factorial(num)); return 0; }
#include <iostream> using namespace std; int factorial(int n) { if (n == 0 || n == 1) { return 1; } return n * factorial(n - 1); } int main() { int num; cout << "Enter a number: "; cin >> num; cout << "Factorial of " << num << " = " << factorial(num) << endl; return 0; }
def factorial(n): if n == 0 or n == 1: return 1 return n * factorial(n - 1) num = int(input("Enter a number: ")) print(f"Factorial of {num} = {factorial(num)}")
<?php function factorial($n) { if ($n == 0 || $n == 1) { return 1; } return $n * factorial($n - 1); } echo "Enter a number: "; $num = intval(trim(fgets(STDIN))); echo "Factorial of $num = " . factorial($num) . "\n"; ?>
import java.util.Scanner; public class Main { public static int factorial(int n) { if (n == 0 || n == 1) { return 1; } return n * factorial(n - 1); } public static void main(String[] args) { Scanner scanner = new Scanner(System.in); System.out.print("Enter a number: "); int num = scanner.nextInt(); System.out.println("Factorial of " + num + " = " + factorial(num)); } }
function factorial(n) { if (n === 0 || n === 1) { return 1; } return n * factorial(n - 1); } const num = parseInt(prompt("Enter a number:")); console.log(`Factorial of ${num} = ${factorial(num)}`);
using System; class Program { static int Factorial(int n) { if (n == 0 || n == 1) { return 1; } return n * Factorial(n - 1); } static void Main() { Console.Write("Enter a number: "); int num = int.Parse(Console.ReadLine()); Console.WriteLine($"Factorial of {num} = {Factorial(num)}"); } }