Recursive fibonacci function.,recursivefibonacci,def fibonacc
Recursive fibonacci function.,recursivefibonacci,def fibonacc
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'
- Illustrate parameter passing: tuple, type and tuple,il
- Returning Multiple Values from Functions,returningfunc
- Demonstrates parameters and return values,,def display
- dir() Function: find out which names a module defines,
- Functional Programming Tools: filter,,# 'filter(fu
- Convert Float number,convertfloat,print str(3.
热门文章:
相关内容
- Illustrate parameter passing: tuple, type and tuple,illustratetuple
- Returning Multiple Values from Functions,returningfunctions,def mul
- Demonstrates parameters and return values,,def display(
- dir() Function: find out which names a module defines,namesdefines,
- Functional Programming Tools: filter,,# 'filter(fu
- Convert Float number,convertfloat,print str(3.
- A generator function: creates its objects on the fly.,generatorcrea
- in function demo,functiondemo,name = 'ABCD
- Copy a dictionary,copydictionary,L = [1,2,3]D
- len() function,lenfunction,message = ra
评论关闭