Fibonacci series

Write a function to generate Fibonacci series with and without recursion. Come up with all the test cases. Walk through the code and explain the benefits of using one over the other (i.e. if you think recursion is good, why?)?