Question

design an algorithm using a flowchart that computes the factorial of an integer n n!=n(n(-1)!(n-2)Your question (max 1024 symbols)

Answer 1

Task:

design an algorithm using a flowchart that computes the factorial of an integer $n$ .

Solution:

Factorial of n:

BEGIN
- read (N)
- F = 1
- M = 1
Label1:
- F = F * M
- if M >= N
- write (F)
- else
- M = M + 1
- goto Label1
END