Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

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

edX CS50x Intro to CS I
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your free account and access expert answers to this and thousands of other questions

Khan Academy is probably more useful than OpenStudy when it comes to programming. http://www.youtube.com/watch?v=kNT5pAyUeqE
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); }
@DangerousJesse I would not say KA is good for C.

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

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.

Not the answer you are looking for?

Search for more explanations.

Ask your own question