Akansha Yadav builds a recursive factorial function in Python. The function checks if n equals 0, returns 1, then multiplies n by factorial(n-1). Testing with 5 returns 120 and with 10 returns 3628800.
Let's create a Python program to find the factorial of a given number. So in this coding environment, I'm going to create a function called factorial passing n as an argument. Then I'm checking whether n is equal to equal to 0. If it is, then it will return 1 to us because for 1 we don't need a factorial. If other case, I am using a recursive function. I'm calling my function again inside the function, which is called recursion. And after that, I am testing it with the 5 and I got 120. And when I am testing it with the 10, I got the Factorial of 10.
