Hello friends here at c programming dot com. I am writing because I'm completely baffled by a question that my instructor has posed to us. He asked us to use a recursive function (outside of the main) to figure the values of fibonacci numbers.If you haven't ever heard of them they go something like this 1,1,2,3,5,8,9,17. . . . As you can see the value of each value is the sum of the last two values. Now I know the concept of recursive functions but I would have a clue on where to even begin with this problem. Any ideas



LinkBack URL
About LinkBacks


