I need a pseudocode and flowchart for the fallowing assingment The factorial of

Question

I need a pseudocode and flowchart for the fallowing assingment The factorial of a positive integer N, denoted by N!, is defined by the following: N! = 1 * 2 * ..... * N (Note: 0! = 1) Using subprograms and functions, create a recursive program to compute N!. The user should input a positive integer and a subprogram should check that the input is correct ( a positive integer). Then use recursion to computer the factorial. Create a subprogram that will call itself to do the multiplication until N = 1. Then display the result in the main program.

Explanation / Answer

recursive implemenation psuedocode function factorial is: input: integer n such that n >= 0 output: [n × (n-1) × (n-2) × … × 1] 1. if n is 0, return 1 2. otherwise, return [ n × factorial(n-1) ] end factorial

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.