Question

Give a recursive algorithm for computing n!,

where n is a nonnegative integer.​

Answer 1

We can build a recursive algorithm that finds n!, where n is a nonnegative integer, based on the recursive definition of n!, which specifies that n! = n · (n − 1)! when n is a positive integer, and that 0!