amp-web-push-widget button.amp-subscribe { display: inline-flex; align-items: center; border-radius: 5px; border: 0; box-sizing: border-box; margin: 0; padding: 10px 15px; cursor: pointer; outline: none; font-size: 15px; font-weight: 500; background: #4A90E2; margin-top: 7px; color: white; box-shadow: 0 1px 1px 0 rgba(0, 0, 0, 0.5); -webkit-tap-highlight-color: rgba(0, 0, 0, 0); } .amp-logo amp-img{width:190px} .amp-menu input{display:none;}.amp-menu li.menu-item-has-children ul{display:none;}.amp-menu li{position:relative;display:block;}.amp-menu > li a{display:block;} /* Inline styles */ figure.acss8880d{max-width:476px;}div.acss138d7{clear:both;}div.acssf5b84{--relposth-columns:3;--relposth-columns_m:2;--relposth-columns_t:2;}div.acss63595{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/uploads/2021/05/dividepy.jpg) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acss6bdea{color:#333333;font-family:Arial;font-size:12px;height:75px;}div.acss1f42e{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/uploads/2022/06/divisionoftwo.jpg) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acssc61bb{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/plugins/related-posts-thumbnails/img/default.png) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acss0f85d{aspect-ratio:1/1;background:transparent url(https://code4coding.com/wp-content/uploads/2020/12/mulfloat.jpg) no-repeat scroll 0% 0%;height:150px;max-width:150px;}a.acss9bfd5{font-size:14.52427184466pt;}a.acssc37f8{font-size:16.427184466019pt;}a.acss29e97{font-size:16.631067961165pt;}a.acss361c8{font-size:17.174757281553pt;}a.acss51c7b{font-size:20.029126213592pt;}a.acssa2e10{font-size:20.097087378641pt;}a.acss5dd67{font-size:21.728155339806pt;}a.acssf0e8e{font-size:12.077669902913pt;}a.acss759e3{font-size:17.922330097087pt;}a.acss0abf8{font-size:21.252427184466pt;}a.acss6bf84{font-size:13.504854368932pt;}a.acss349b0{font-size:10.038834951456pt;}a.acssf23c5{font-size:8pt;}a.acss7e0a8{font-size:9.2233009708738pt;}a.acsse6f77{font-size:16.970873786408pt;}a.acssc51bb{font-size:14.116504854369pt;}a.acss38f57{font-size:11.26213592233pt;}a.acss066f0{font-size:22pt;}a.acss4e811{font-size:17.31067961165pt;}a.acss9cc90{font-size:12.417475728155pt;}a.acss01721{font-size:15.339805825243pt;}a.acsse9f66{font-size:15.543689320388pt;}a.acss72254{font-size:20.708737864078pt;}a.acsseedeb{font-size:20.776699029126pt;}a.acss25b87{font-size:14.320388349515pt;}a.acss7c517{font-size:12.757281553398pt;}a.acss7a3ee{font-size:18.941747572816pt;}a.acssf92d5{font-size:18.26213592233pt;}a.acss551d3{font-size:16.291262135922pt;} .icon-widgets:before {content: "\e1bd";}.icon-search:before {content: "\e8b6";}.icon-shopping-cart:after {content: "\e8cc";}
Calculations

C program to find factorial of a number

C program to find factorial of a number

In this tutorial, we will discuss the concept of C program to find factorial of a number

Factorial is a product of all positive descending integer begins with a specified number (n) and calculates up to one

Factorial of number of n

 

Example

factorial of 5 is

5!=5*4*3*2*1=120

 

factorial of 4 is

4!=4*3*2*1=24

 

The factorial of a positive number n is given below

factorial of n is

n!=n*(n-1)*....2*1

 

There are many ways to calculate a factorial using C programming language. some of them are described as below.

the user can provide numbers as they wish and get the factorial according to their input

Code to find factorial of a number

Find factorial using for loop

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int n,i,factorial=1;
    printf("Enter an integer..: ");
    scanf("%d",&n);

    if(n<0){
        printf("Factorial doesn't available to a negative number");
    }

    else{
        for(i=1; i<=n; i++){
            factorial*=i;  //this is equal to factorial=factorial*1

        }
           printf("Factorial of %d is = %d ",n,factorial);
    }
    getch();
    return 0;
}

When the above code is executed, it produces the following results

case 1

Enter an integer..:8
Factorial of 8 is= 40320

 

case 2

Enter an integer..:0
Factorial of 0 is= 1

 

case 3

Enter an integer..:-3
Factorial doesn't available to a negative number

 

Find factorial using the while loop

Program 2

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int n,i,factorial=1;
    printf("Enter an integer..: ");
    scanf("%d",&n);

    if(n<0){
        printf("Factorial doesn't available to a negative number");
    }

    else{
            i=1;
        while(i<=n){
            factorial*=i;  //this is equal to factorial=factorial*1
           i++;
        }
           printf("Factorial of %d is = %d",n,factorial);
    }
    getch();
    return 0;
}

When the above code is executed, it produces the following results

Enter an integer..:5 
Factorial of 5 is= 120

 

Find factorial using the do-while loop

Program 3

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int n,i,factorial=1;
    printf("Enter an integer..: ");
    scanf("%d",&n);

    if(n<0){
        printf("Factorial doesn't available to a negative number");
    }

    else{
            i=1;
    do{
        factorial*=i;  //this is equal to factorial=factorial*1
           i++;

        }while(i<=n);
           printf("Factorial of %d is = %d",n,factorial);
    }
    getch();
    return 0;
}

When the above code is executed, it produces the following results

Enter an integer..:6 
Factorial of 6 is= 720

 

Find factorial using recursion

#include <stdio.h>
#include <stdlib.h>

long factorial(int);  //function declaration
int main()
{
    int n;
    long fact;

    printf("enter the integer to find factorial\n");
    scanf("%d", &n);

    if(n<0)
        printf("Factorial doesn't available to a negative number");
    else{
        fact=factorial(n);//call the method
        printf("%d! = %ld\n",n,fact);
    }
    getch();
    return 0;
}
long factorial(int n)
{

    if(n==0)
        return 1;
    else
        return(n*factorial(n-1));
}

When the above code is executed, it produces the following results

enter the integer to find factorial
6
6!=720

 

Find factorial using the function

#include <stdio.h>
#include <stdlib.h>
long factorial(int);
int main()
{
    int num;
    long fact=1;

    printf("Enter a number to calculate factorial\n");
    scanf("%d",&num);


    printf("%d! = %ld\n",num,factorial(num));
    getch();
    return 0;
}
long factorial(int n)
{
    int i;
    long result=1;
    for(i=1; i<=n; i++)
        result=result*i;
    return result;
}

When the above code is executed, it produces the following results

Enter a number to calculate factorial
6
6!=720

Similar post

Java program to find factorial of a number

C++ program to find factorial of a number

C program to find factorial of a number

Python program to find factorial of a number

Java program to find factorial of a number using method

C++ program to find factorial of a number using function

C program to find factorial of a number using function

Python program to find factorial of a number using function

Java program to find factorial of a number using recursion

C++ program to find factorial of a number using recursion

C program to find factorial of a number using recursion

Python program to find factorial of a number using recursion

 

 

Suggested for you

C program operator

C program if statements

C program for loop

C program while loop

C program do-while loop

C program function

 

Cpp program to find factorial of a number
Python program to find factorial of a number
Karmehavannan

I am Mr S.Karmehavannan. Founder and CEO of this website. This website specially designed for the programming learners and very especially programming beginners, this website will gradually lead the learners to develop their programming skill.

Recent Posts

10 best Ways to Subtract Two Numbers in Java (With Examples)

10 best Ways to Subtract Two Numbers in Java (With Examples) In this article, we…

3 weeks ago

Array Data Structure: Definition, Types, Operations & Advantages

Array Data Structure: Definition, Types, Operations & Advantages Array Data Structure Introduction In this post,…

4 weeks ago

20 ways to subtract two numbers in Java

20 ways to subtract two numbers in Java In this article, we will discuss the…

4 weeks ago

10 simple ways to add two numbers in Java

10 simple ways to add two numbers in Java In this article, we will discuss…

2 months ago

Write a Python program to find the first n prime numbers

Write a Python program to find the first n prime numbers In this article we…

3 months ago

Python: Calculate Average of odd and even in a list using loops

Python: Calculate Average of odd and even in a list using loops In this post,…

3 months ago