Recursive Fibonacci number

Original link: http://www.cnblogs.com/linbinqiang/p/5286199.html

def fab(n):
  if n==1:
    return 1
  if n==0:
    return 0
  else:
    result=int(fab(n-1))+int(fab(n-2))    
    return resul

　　

Reproduced in: https: //www.cnblogs.com/linbinqiang/p/5286199.html