Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

cutestpearl

  • one year 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
    • one year 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
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 4

    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
    • one year 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 year 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

Sign Up
Find more explanations on OpenStudy
Privacy Policy