Recursive fibonacci function. : recursive function « Function « Python Tutorial

1. Python Tutorial
2. Function
3. recursive function

def fibonacci( n ):

   if n < 0: 
      print "Cannot find the fibonacci of a negative number"

   if n == 0 or n == 1:  # base case
      return n
   else:
      return fibonacci( n - 1 ) + fibonacci( n - 2 )

number = int( raw_input( "Enter an integer: " ) )
result = fibonacci( number )
print "Fibonacci(%d) = %d" % ( number, result )