recursive fibonacci that prints n first fibonacci element

Question

2.33/5 (3 votes)

See more:

Hi friends.

I want to write a recursive function to print N first element into the recursive function.
But i dont know how do it?
for example recalling Fib(8), then it should print 0 1 1 2 3 5 8 13

thanks.

Posted 25-Nov-13 0:05am

r.kh

Updated 25-Nov-13 0:24am

CPallini

v2

Add a Solution

Comments

Stefan_Lang 25-Nov-13 6:16am

That is not a question What have you tried? What is your problem? What is not working?

Also: be advised that we won't do other peoples' homework - you're supposed to do it yourself. We may help if you're stuck with a *specific* problem. but for that we need a *specific* question.

CPallini 25-Nov-13 6:24am

And what is your doubt?

Richard MacCutchan 25-Nov-13 6:48am

Hint: Google.

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

HAMZEI · Answer 1 · 2013-11-25T04:34:00

If you try to solve with recursive approch
with a fucnction like this :

C++

int F(int n)
{
   if(n==0 || n==1){
         cout<<1<<" ";
   return 1;
   }
   int RET=F(n-2)+F(n-1);
   cout<<RET<<" ";
}

this Function would be O(2^N)

i suggest you Dyanmic approch
First try to fill a Table of F[]

C++

int F[maxn];
F[0]=F[1]=1;

for(int i=2;i<maxn;i++)>
   F[i]=F[i-1]+F[i-2];

now you have Fibonacci Sequenced Saved in An Array with The Time Order O(N)

Stefan_Lang · Answer 2 · 2013-11-26T21:44:00

How to define a recursive function in C/C++:

C++

int foo(int n) {
   int result = 0;
   // step 0: pin down the result value(s) for starting the recursion
   const int first_value = 1; 
   // step 1: test if you're at the root of the recursion
   if (0 == n)
      result = first_value;
   else {
      // step 2: determine previous result through recursion
      int previous_result = foo(n-1);
      // step 3: determine result from previous result
      result = n*previous_result;
   }
   return result;
}

Notes:
- step 0 may require more than one value if your recursion requires more than 1 value to calculate the next one.
- step 1 may require multiple checks if you have multiple starting values
- bonus hint: you should add an additional check ( e. g. if (n < 0) ) to make sure you have a valid argument and won't accidentally run into an endless loop.

Read and understand the notes to adapt this example code for the fibonacci sequence. I won't do that for you since it smells of homework, and I can't help you learn if I do it for you.

recursive fibonacci that prints n first fibonacci element

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0