C++ Program to Find Factorial of a Large Number Using Recursion

C++ Program to Find Factorial Using Recursion

Last Updated : 08 Feb, 2024

The factorial of a number is denoted by "n!" and it is the product of all positive integers less than or equal to n. In this article, we will learn how to find the factorial of a number using recursion in C++.

Example

Input: 5
Output: Factorial of 5 is 120

Factorial Using Recursion in C++

The Factorial of the number is calculated as below:

n! = n × (n−1) × (n−2) × … × 2 × 1

To find factorial using the recursion approach follow the below approach:

Define a function to calculate factorial recursively.
Create a Base case - if n is 0 or 1, return 1.
If n is not 0 or 1, return n multiplied by the factorial of (n-1).

C++ Program to Find Factorial Using Recursion

The below program finds a factorial of a given number using recursion.

C++

// C++ program to find factorial of a number using recursion
#include <iostream>
using namespace std;

// Define a function to calculate factorial
// recursively
long long factorial(int n)
{
    // Base case - If n is 0 or 1, return 1
    if (n == 0 || n == 1) {
        return 1;
    }
    // Recursive case - Return n multiplied by
    // factorial of (n-1)

    return n * factorial(n - 1);
}

int main()
{
    int num = 5;
    // printing the factorial
    cout << "Factorial of " << num << " is "
         << factorial(num) << endl;

    return 0;
}

Output

Factorial of 5 is 120

Time Complexity: O(N)
Auxiliary Space: O(N)

C++ Program to Find Factorial of a Large Number Using Recursion

anuragvbj79

Improve

Article Tags :

Practice Tags :

Similar Reads

C++ Program to Find Factorial of a Large Number Using Recursion

Given a large number N, task is to find the factorial of N using recursion. Factorial of a non-negative integer is the multiplication of all integers smaller than or equal to n. For example factorial of 6 is 6*5*4*3*2*1 which is 720. Examples: Input : N = 100Output : 93326215443944152681699238856266

C++ Program to Print an Array using Recursion

Write a program in C++ to print an Array using Recursion 1. Using Static Variable Static variables have the property of preserving their value even after they are out of their scope! Hence, static variables preserve their previous value in their previous scope and are not initialized again in the ne

C++ Program For Sum of Natural Numbers Using Recursion

Natural numbers include all positive integers from 1 to infinity. It does not include zero (0). Given a number n, find the sum of the first n natural numbers. To calculate the sum, we will use the recursive function recur_sum(). Examples: Input: 3Output: 6Explanation: 1 + 2 + 3 = 6 Input: 5Output: 1

C++ Program to Find Factorial of a Number Using Dynamic Programming

The Factorial of a number N can be defined as the product of numbers from 1 to the number N. More formally factorial of n can be defined by function, [Tex]f(n) = 1 \times 2 \times 3 \times... \ n[/Tex] In this article, we will learn how to find the factorial of a number using dynamic programming in

C++ Program To Print Reverse of a String Using Recursion

Write a recursive function to print the reverse of a given string.Â Code:Â C/C++ Code // C++ program to reverse a string using recursion #include <bits/stdc++.h> using namespace std; /* Function to print reverse of the passed string */ void reverse(string str) { if(str.size() == 0) { return; }

C++ Program to Find Factorial of a Number Using Iteration

Factorial of a number n is the product of all integers from 1 to n. In this article, we will learn how to find the factorial of a number using iteration in C++. Example Input: 5Output: Factorial of 5 is 120Factorial of Number Using Iteration in C++To find the factorial of a given number we can use l

C++ Program To Find Factorial Of A Number

The Factorial of a non-negative integer is the multiplication of all integers smaller than or equal to n. For example, the factorial of 6 is 6*5*4*3*2*1 which is 720. Recursive Solution Factorial can be calculated using the following recursive formula. n! = n * (n-1)! n! = 1 if n = 0 or n = 1 Below

Programs for Printing Pyramid Patterns using Recursion

This article is aimed at giving a recursive implementation for pattern printing. Simple triangle pattern: C/C++ Code // C++ code to demonstrate star pattern #include <iostream> using namespace std; // function to print a row void printn(int num) { // base case if (num == 0) return; cout <

C++ Program To Print Reverse Floyd's Triangle

Floydâ€™s triangle is a triangle with first natural numbers. Task is to print reverse of Floydâ€™s triangle.Examples: Input: 4 Output: 10 9 8 7 6 5 4 3 2 1 Input: 5 Output: 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 C/C++ Code // C++ program to print reverse // of Floyd's triangle #include <bits/stdc++.h

Recursive Program for Binary to Decimal

Given a binary number as string, find its decimal equivalent. Examples: Input : binary = "101"Output : 5 Input : binary = "1111"Output : 15 We have discussed iterative solution to convert Binary to Decimal.The idea is simple, we add current term and recur for remaining terms. C/C++ Code // Recursive