This is a simple library of Fibonacci number solvers. Each implementation has two algorithms.
This implementation figures out each number sequentially, holding on to only the last two. Complexity: O(N)
This implementation calls itself recursively until it gets to the first and second numbers. Complexity: O(2^N)
ruby fibonacci.rb <number> [number...]
javac Fibonacci.java java Fibonacci <number> [number...]