A method of implementing Fibonacci recursive functions in Python _python

In this paper, a simple example of the Python implementation of Fibonacci sequence recursive function method, the code is concise and understandable. Share for everyone to use for reference.

The main function code is as follows:

Def Fab (n):
  if n==1: return
    1
  if n==0: return
    0
  else:
    result=int (Fab (+int) n-2) return result    
    

The test code is as follows:

For I in range:
  print fab (i)

I hope this article will help you with your study of Python programming.