Recursive fibonacci function. : Function Recursive : Function PYTHON examples

Recursive fibonacci function.

def fibonacci( n ):    if n == 0 or n == 1:  # base case       return n    else:       # two recursive calls       return fibonacci( n - 1 ) + fibonacci( n - 2 ) number = int( raw_input( "Enter an integer: " ) ) if number > 0:    result = fibonacci( number )    print "Fibonacci(%d) = %d" % ( number, result ) else:    print "Cannot find the fibonacci of a negative number"

Related Scripts with Example Source Code in same category :
• Recursive definition of function factorial

Leave a Comment / Note

Name (required)

email (will not be published) (required)

Website

Vérification Refresh		Enter code
Verification is used to prevent unwanted posts (spam). .