Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

cutestpearl

  • 4 months ago

c programming (fibonacci series) can someone show me the source code for recursion in fibonacci series. my logic is : sum=first+second; second=sum; first=second; also show in reverse order

  • This Question is Open
  1. DangerousJesse
    • 4 months ago
    Best Response
    You've already chosen the best response.
    Medals 2

    Khan Academy is probably more useful than OpenStudy when it comes to programming. http://www.youtube.com/watch?v=kNT5pAyUeqE

  2. tdabboud
    • 4 months ago
    Best Response
    You've already chosen the best response.
    Medals 3

    This will compute the fib of any value (val): int fib(int val){ if(val == 0) return 0; else if(val == 1) return 1; return fib(val-1) + fib(val-2); }

  3. e.mccormick
    • 4 months ago
    Best Response
    You've already chosen the best response.
    Medals 1

    @DangerousJesse I would not say KA is good for C.

  4. MaaniAxiz
    • one month ago
    Best Response
    You've already chosen the best response.
    Medals 0

    a series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. The simplest is the series 1, 1, 2, 3, 5, 8, etc. i too suggest you to refer Khan Academy.

  5. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Ask a Question
Find more explanations on OpenStudy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.