← Back to Functions/Methods
Question 121
Function: Recursive Factorial
Function: Recursive Factorial
Complete the function factorial so it computes n! using RECURSION (no loops). The function must call itself. The main function reads n and prints n!. Base case: factorial(0) and factorial(1) are 1. Recursive case: factorial(n) = n * factorial(n - 1).
Expected Output:
120
Topics:
Functions/Methods
Code Editor
1
Tab to indent · Ctrl+Enter to run · Ctrl+Space to expand shortcuts (p, fori)
Your Output
Run your code to see the output here...
Test Cases
Run your code to see test case results.