Explore BrainMass

# Choose an iterative procedure to re-write as recursive

Not what you're looking for? Search our solutions OR ask your own Custom question.

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

Choose an iterative procedure that you would re-write as recursive, what challenges do you usually face and how can they be resolved?

https://brainmass.com/computer-science/programming-languages/choose-iterative-procedure-write-recursive-251274

#### Solution Preview

I have chosen to rewrite the iterative definition of calculating factorial of a number using a recursive procedure. First, the iterative definition of factorial is as follows

For any non-negative integer n, the factorial of n , denoted n! , can be defined   by
n! = 1 X 2 X .. X ...

#### Solution Summary

I have chosen to rewrite the iterative definition of calculating factorial of a number using a recursive procedure. First, the iterative definition of factorial is as follows

For any non-negative integer n, the factorial of n , denoted n! , can be defined   by
n! = 1 X 2 X .. X n
where for n=0 the empty product is taken to be 1 .

We can write a simple C code snippet for this definition. (given in the solution)

\$2.49