Question

Write a pseudocode algorithm to compute the product of the first n positive integers. How many multiplications does your algorithm perform?

Answer 1

Input: n
If n≤2 then
P=n
Else {
P=2
For i=3 to n
P=i∙P }
Return P // product of the first n positive integers

The algorithm perform does not perform multiplications if n≤2, and it performs (n-2) multiplications if n>2.