It's even faster to write it on your own. Just follow the bare definition

~~ and use the loop, no recursion~~. Oops! You say "recursive". OK then, use recursion.

Any type is fine, it does not really matter for the algorithm.

Instead of wasting time on finding exact implementation, use just first principles:

http://en.wikipedia.org/wiki/Fibinochi_numbers[

^] (I think you already know that, but take a look).

By the way, take this hint: you don't really need an array, unless you're required to return the array of 0..N Fibonacci numbers, not N-th Fibonacci number as you put it in first place.

If you have the implementation with long double, just change to type the 128-bit integer or any other at your liking: the algorithm should not change.

—SA