Table of Contents

1. Method 1

Use a non-recursive method

2. Method 2

Use recursive method

1. Method 1

Use a non-recursive approach

n!=1*2*3*...*n; Using for can solve this problem

//non-recursive#include int main(){int i = 0;int n = 0;int sum = 1;//sum is initialized to 1, not 0scanf("%d", &n);for (i = 1;i <= n;i++){sum = sum * i;}printf("%d!=%d", n, sum);return 0;}

2. Method 2

adoptedRecursive method

Text Explanation:
//Recursive
//n!=1*2*3*...*n
//get(1*2*3*...(n-1)) * n
//get(1*2*3*...(n-2))*(n-1)* n
//...
//get(1*2) 3* ... *(n-2) *(n-1)* n
//1*2...*(n-1)*n

Image explanation:

Example: Find the factorial of 5p>

Complete code map:

Analytical Diagram:

#include int get(int n){if(n>1){return n * get(n - 1);}else if(n == 1){return 1;}}int main(){//int n = 0, sum = 0;printf("Please enter a number: ");scanf("%d", &n);sum = get(n);printf("%d!=%d", n, sum);return 0;}