Factorial Program in C | Factorial Program in C Using Recursion

 

1. Program for finding factorial of a number using for loop

This is the simplest way to find factorial of a program. In this program, we will ask the user to enter the number which user want to find factorial of that number.

The factorial of a negative number doesn’t exist so we will apply condition if the user enters a negative number.

C

1

#include <stdio.h>

2

int main() {

3

int n, i;

4

unsigned long long fact = 1;

5

printf("Enter an integer: ");

6

scanf("%d", &n);

7

if (n < 0)

8

printf("Error! Factorial of a negative number doesn't exist.");

9

else {

10

for (i = 1; i <= n; ++i)

11

{

12

fact *= i;

13

 }

14

printf("Factorial of %d = %llu", n, fact);

15

 }

16

return 0;

17

}

Output:

Here the factorial of number may be large so we have used unsigned long long. If the user enters a negative number then the compiler will show an error message.

Logic:

1st Iteration: Here at first i=1,fact=1 and n=5 i.e(i<=n).fact=fact*i i.e fact=1*1=1.now i is incremented,so i becomes 2.

2nd Iteration: Here i=2,fact=1 and n=5 i.e(i<=n).fact=fact*i i.e fact=1*2=2.now i is incremented,so i becomes 3.

3rd Iteration: Here i=3,fact=2 and n=5 i.e(i<=n).fact=fact*i i.e fact=2*3=6.now i is incremented,so i becomes 4.

4th Iteration: Here i=4,fact=6 and n=5 i.e(i<=n).fact=fact*i i.e fact=6*4=24.now i is incremented,so i becomes 5.

5th Iteration: Here i=5,fact=24 and n=5 i.e(i<=n).fact=fact*i i.e fact=24*5=120.now i is incremented,so i becomes 5.

6th Iteration: now i is incremented to 6 which is greater than n 6>5 i.e(i>n) so the program is terminated and the answer is 120.

2. Factorial Program in C Using Recursion

Recursion:

It is the method in which the function calls itself directly or indirectly. Recursion consists of two main conditions i.e base condition and the recursive call.

C

1

#include<stdio.h>

2

int fact(int);

3

int main()

4

{

5

int num;

6

printf("Enter the number whose factorial is to be find :");

7

scanf("%d" ,&num);

8

if(num<0)

9

{

10

printf("ERROR. Factorial is not defined for negative integers");

11

}

12

printf("Factorial of %d is %d", num, fact(num));

13

return 0;

14

}

15

int fact(int num)

16

{

17

if(num==0) //base condition

18

{

19

return 1;

20

}

21

else

22

{

23

return(num*fact(num-1)); //recursive call

24

}

25

}

Output:

In Above program int fact(int) is function prototype and in printf,fact(num) function call is made.

If the user enters 5 as the input then the call to the function fact(5) is made and 5 which is not equal to 0. So the flow goes to the else statement where return call is made to the fact(4).

This process continues till the 1 is returned and thus we get the factorial of 5 i.e 120.

3. Program to find factorial using While loop

It is the same program as a program of for loop.only difference is that we use while loop instead of while loop but the logic is the same.

C

1

#include <stdio.h>

2

int main()

3

{

4

  int Number, i = 1; 

5

  long Factorial = 1;

6

  printf("\n Please Enter any number to Find Factorial\n");

7

  scanf("%d", &Number);

8

  while (i <= Number)

9

   {

10

     Factorial = Factorial * i;

11

     i++;

12

   }

13

  printf("Factorial of %d = %d\n", Number, Factorial); 

14

  return 0;

15

}

Time Complexity of the above solution is O(n).

4. Program using do-while loop

In this program, we will ask user to enter the number which user want to find factorial of that number.

C

1

#include<stdio.h>

2

#include<conio.h>

3

void main()

4

{

5

long n, i, fact=1;

6

printf("Enter any number = ");

7

scanf("%ld",&n);

8

i=n;

9

if(n>=0)

10

{

11

do

12

{

13

fact=fact*i;

14

i--;

15

}

16

while(i>0);

17

printf("\nFactorial = %ld",fact);

18

}

19

else

20

{

21

printf("fact on -ve no is not possible");

22

}

23

}

Output:

5. Program Using Pointers

C

1

#include <stdio.h>

2

int main()

3

{

4

  int i, Number, *P; 

5

  long Factorial = 1;

6

  printf("\n Please Enter any number to Find Factorial\n");

7

  scanf("%d", & Number); 

8

  P = &Number;  //assigning value

9

  for (i = 1; i <= *P; i++)

10

   {

11

     Factorial = Factorial * i;

12

   }  

13

  printf("\nFactorial of %d Using Normal Variable  = %d\n", Number, Factorial);

14

  printf("Factorial of %d Using Pointer Variable = %d\n", *P, Factorial);

15

  return 0;

16

}

Output:

In Pointer, we point address of Number to the address of Pointer variable. In the above program, we use P=&number where p is a pointer.

6. To find factorial using functions

This is the modular approach of the program. If we want to change in the code we need not change the whole code, instead, we will do change in function.

C

1

#include <stdio.h>

2

long factorial(int num) //function 

3

{

4

  int i;

5

  long fact = 1;  

6

  for (i = 1; i <= num; i++)

7

    fact = fact * i;

8

 return fact; //returns to function call

9

} 

10

int main() //execution begins from main() method

11

{

12

  int num;  

13

  printf("Enter a number to calculate its factorial");

14

  scanf("%d", &num);

15

  if(num<0) //if the input is a negative integer

16

  {

17

   printf("Factorial is not defined for negative numbers.");

18

   }

19

//call to factorial function passing  the input as parameter

20

  printf("Factorial of %d = %d", num, factorial(num)); 

21

   return 0;

22

}

Output:

7. Using Call By Reference

In this program instead of user-declared value the address of variable will pass to the function we created.

C

1

#include <stdio.h>

2

long Calculate_Factorial(int *);  

3

int main()

4

{

5

  int Number; 

6

  long Factorial = 1;

7

  printf("\n Please Enter any number to Find Factorial\n");

8

  scanf("%d", &Number);

9

  Factorial = Calculate_Factorial(&Number);

10

  printf("Factorial of %d = %d\n", Number, Factorial);

11

  return 0;

12

}

13

long Calculate_Factorial(int *Number)

14

{ 

15

  int i; 

16

  long Factorial = 1;

17

  for (i = 1; i <= *Number; i++)

18

   {

19

     Factorial = Factorial * i;

20

   } 

21

  return Factorial;

22

}

Output: