# Write a recursive function to compute the factorial of a number

To illustrate it, consider the example of the factorial-computing function. Recursive functions are powerful mechanism in programming. The most common error is infinite recursion, when the chain of function calls never ends well, actually, it ends when you run out of free memory in your computer.

But if you initialize some variable inside of the function, you won't be able to use this variable outside of it. It is clear that factorial is easy to calculate, using a for loop. Functions are the code sections which are isolated from the rest of the program and executed only when called. If we were able to calculate the value of n-1! In the end, we get to 0! At the end of the row, put a colon.

## Factorial using recursion c++

Such variables declared within a function are called local. Top Rated User Solution. Imagine that we need in our program to calculate the factorial of various numbers several times or in different places of code. They all have something in common: they can take parameters zero, one, or several of them , and they can return a value although they may not return. View the challenge Official solution This challenge requires you to return the factorial of a given number. This function calculates the value of n! How to calculate n-2!? Namely, in the function f the identifier a becomes a local variable, since the function contains the command which modifies the variable a. Here is an example of how such a function can be written. To avoid re-writing the same logic in programming languages there are functions. But how to compute n-1!? A factorial of some number N is N multiplied by N-1 multiplied by N-2 and so forth until you reach the number 1.
Rated 6/10 based on 62 review