n-th element of the fibonacci sequence

Quote:

---

Originally Posted by me001

if n is negative code won't work.

---

Correct. What about if n is very large?

QuantumPete

any nice free visual C compiler like Miracle C Compiler?

Quote:

---

any nice free visual C compiler like Miracle C Compiler?

---

Frankly, for Windows, Visual C++ is the best, but if you found that has a learning curve that you dislike, then any other IDE would have a learning curve that you do not want to overcome. That said, Code::Blocks would be your next best bet.

thanks Code::Blocks is excellent

If n is very large, code will run damm slow.
This is not efficient code.

Quote:

---

If n is very large, code will run damm slow.
This is not efficient code.

---

Yes, though there is also a limitation in terms of the range of int.

Quote:

---

Originally Posted by laserlight

Yes, though there is also a limitation in terms of the range of int.

---

That's more what I was thinking of. Also, since this is a recursive function, you'll break the stack with sufficiently large n values.

QuantumPete

To work nothing. It is fine

EDIT: Just for practice, try writing the code using fewer lines. Then try to write the algorithm using more variables instead of recursion