import java.math.BigInteger;
/*
===========================================================================
Author : Catarina Moreira
Copyright : Catarina Moreira all rights reserved
Description : Implementation of the fibonacci sequence using recursion
===========================================================================
*/
public class Recursive
{
public BigInteger runFibonacci( int n )
{
if( n == 0)
return BigInteger.ZERO;
if( n == 1)
return BigInteger.ONE;
return runFibonacci( n - 1 ).add(runFibonacci( n - 2 ));
}
}