Computer scienceSoftware development foundationsComputer science fundamentalsProgramming conceptsIntro to programming

Recursion basics

Decoding a Recursive Function!

Report a typo

Consider the following function:

 function factorial(integer n)
    if (n == 1) then
       return 1
    else
       return n * factorial(n-1)

What are the correct statements about this recursive function?

Select one or more options from the list

This is a factorial function that uses a recursive approach to calculate the factorial of a number.

This function will give incorrect output for n = 5.

factorial(n-1) makes a recursive call by reducing the argument towards the base case.

This function may lead to an infinite recursion if n <= 0.

n * factorial(n-1) helps to keep the product up to the nth term in the recursion process.

Create a free account to access the full topic