Why I ended up playing with C, Java and the Fibonacci series on the last free afternoon of the September Vacation.

Here are the times taken to use recursive Fibonacci function calls to compute the first 47 numbers in the Fibonacci series.

Using C with longs

Using Java with longs

Using Java with longs wrapped in BigIntegers.

Think about it and draw your own conclusions!

Here are the source code files used: fib.c, Fib.java and BigFib.java.

If you run the Java with longs example you will notice that the 46th value computed is negative. Why?