Purchase Solution

Fibonacci Number Visual C++ Recursion Iteration Runtime

Not what you're looking for?

Ask Custom Question

I need help to writing a program "VC++.net" with the specified input and output.

Use a computational program or programs you have written to do the following exercises.

Given any non-negative integer n,

a.Find the nth Fibonacci number using iteration.

b.Find the nth Fibonacci number using recursion.

c.Compare the number of operations and the CPU time needed to compute Fibonacci numbers recursively vs. that needed to compute them iteratively.

Maybe these pseudocodes been helpful;

A Recursive Algorithm for Fibonacci Numbers.

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.

Procedure iterative Fibonacci (n : nonnegative integer )
If n=0 then y:=0
else
begin
x := 0
y := 1
For i := 1 to n - 1
begin
z := x + y
x := y
y := z
end
end

Please attention
This program must run in the Visual C++.NET. please the whole project included in the attached Zip file.
Please write simple code that be understandable for me

Thank you

Purchase this Solution
Solution Summary

In this solution you will learn how to find Fibonacci numbers through
a) Recursion and
b) Iteration

Solution Preview

Please see the attached fibonacci.zip
It contains the complete VC++ project folder along with the source code and executable file.
This is just one way of doing it. Ofcourse as a student you need to develop your own way of completing this. In anticipation of a ...

Purchase this Solution
Free BrainMass Quizzes
Javscript Basics

Quiz on basics of javascript programming language.

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.

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.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

Excel Introductory Quiz

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

View More Free Quizzes
Related BrainMass Solutions

  • How to Convert a Recursive Procedure into Iterative

    The Fibonacci sequence is a popular example of recursion[3]: [base cases] Fib(0) is 1 Fib(1) is 1 For all integers n > 1: Fib(n) is (Fib(n-1) + Fib(n-2)) [recursive definition] We can write a simple C code snippet for this definition.

  • Runtime Analysis of Search Algorithm

    A sequential search of the array for the number 19 would go through each element of the array starting with the first until the number 19 was found. The runtime for this algorithm is O(n), where n is the size of the array.

  • Fibonacci Sequence - the matrix approach

    215071 Fibonacci Sequence - the matrix approach The Fibonacci sequence is defined recursively as f_(n+1) = f_n + f_(n-1) . Obtain a closed form formulas for f_n using the iteration matrix (0,1,1,1) applied to the vector .. (see attached file).

  • Visual C++

    130834 Visual C++ Write a C++ value returning function that implements the recursive formula F(n) = F(n-1) + F(n+2) with base cases F(0)=1 and F(1) =1 #include using namespace std; long fib_num(long); int main(){ long num =

  • C++ Programming Language Future Extensions

    Are programming languages becoming neutral or agnostic when used in conjunction with Integrated Development Environments based on Common Runtime Libraries such as Visual Studio.NET? "1.

  • LISP as dominant in the field of Artifical Intelligence

    Recursion. Recursion existed as a mathematical concept before Lisp of course, but Lisp was the first programming language to support it. (It's arguably implicit in making functions first class objects.) 4. A new concept of variables.

  • problem using recursion

    72138 Problem using Recursion Please provide a little guidance on how to solve the following problem using recursion. I can understand solving it using iteration .. but not recursion. Design a game called Jump it.

  • Solve Fibonacci recursion relation

    129214 Solve Fibonacci Recursion Relation Solve the recurrence relation x_(n+1) = x_n + x_(n-1), x_0 = 1, x_1 = 1.

  • Recursion and Iteration

    524881 Recursion and Iteration Can someone please help with my practice questions? I would like details and explanations using words to show how you got the answer.

View More Related Solutions