Can anyone help me i dont understand this at all!
jediahsan 0 Newbie Poster
Recommended Answers
Jump to Postagree with bevoX..use iterative method instead of recursive method..
Jump to PostIf you have an assignment to do it with a recursive function, you can't exactly do it another way and expect to get credit, can you?
The fibonacci sequence is where each successive number is the sum of the two numbers before it. A recursive function can call itself …
All 6 Replies
h3xc0de 0 Junior Poster in Training
I'm sure if you typed it into Google you would find an answer.
BevoX 39 Junior Poster in Training
Try to avoid recursive functions if you can, they can slow your program greatly.
h3xc0de 0 Junior Poster in Training
Try to avoid recursive functions if you can, they can slow your program greatly.
It all depends on the problem being solved by the recursive function.
cikara21 37 Posting Whiz
agree with bevoX..use iterative method instead of recursive method..
death_oclock 103 Posting Whiz
If you have an assignment to do it with a recursive function, you can't exactly do it another way and expect to get credit, can you?
The fibonacci sequence is where each successive number is the sum of the two numbers before it. A recursive function can call itself for previous states! Pass in a parameter to determine which number of the sequence to calculate. Also, remember to put "stop cases" in your function to avoid infinite recursion.
Abinet yilma 0 Newbie Poster
fibonacci is defined recursively as follows
f(n)=f(n-1)+f(n-2)
f(1)=1
f(0)=1
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.