Purchase Solution

Choose an iterative procedure to re-write as recursive

Not what you're looking for?

Ask Custom Question

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

Purchase this Solution
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 [1] [2] 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)

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 [1] [2] by
n! = 1 X 2 X .. X ...

Purchase this Solution
Free BrainMass Quizzes
Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

View More Free Quizzes
Related BrainMass Solutions

  • Iterative and Recursive Algorithms

    Find an example or a recursive procedure and represent it as an iterative procedure. Also, choose an iterative procedure that you would re-write as recursive. What challenges did you face in the process? How did you go about resolving them?

  • How to Convert a Recursive Procedure into Iterative

    251275 How to Convert a Recursive Procedure into Iterative Find an example or a recursive procedure and represent it as an iterative procedure. what challenges would you face and how can we resolve it?

  • An Iterative GCD Program and Testing in C

    95250 An Iterative GCD Program and Testing in C Write program to test function then write and test an equivalent iterative function int gcd (int a, int b) { int r; if ((r=a%b)==0) return b else return gcd(b,r); } The following program has been

  • Fibonacci Number Visual C++ Recursion Iteration Runtime

    Procedure fubonacci(n: nonnegative integer) If n = 0 then Fibonacci(0) := 1 else if n = 1 then fiponacci(1) :=1 else fibonacci(n) := Fibonacci (n - 1) + fibnacci(n - 2) An Iterative Algorithm for computing Fibonacci Numbers.

  • Discrete Math:Recursion

    Describe a favorite recreational activity in terms of its iterative components, such as solving a crossword or Sudoku puzzle or playing a game of chess or backgammon. Also, mention any recursive elements that occur. 4.

  • Algorithms to print the daily salary of a worker

    call will print the salary for the next day recursiveWay (day+1, 2*salaryForDay) } } Iterative logic will be invoked as iterativeWay() while the recursive logic needs to be invoked as recursiveWay(1,1) specifying the start day and

  • Java data structures and alg.

    QUESTION 2 Choose five different lengths of lists ranging from small (e.g. 10) to large (as large as you can and still finish executing in a few minutes), with reasonably-spaced intermediate values. For instance: 10, 100, 1000, 10000, 100000.

  • financial planning

    268122 Financial Planning an Iterative Process Why is financial planning an iterative process? How often should financial plans be re-cast? What considerations impact the need to re-cast financial plans? (At least 200 word).

  • Discrete Math : Logic (40 MC Problems)

    A procedure that starts with the value of the function at 1 and then successively applies the definition to find the value of the function at successively larger integers is said to be: a. recursive. b. iterative. c. factorial. d.

View More Related Solutions