Python Case 006 (Fibonacci series)

#! /usr/bin/python
#-*-coding:utf-8-*-"" "An interesting topic Fibonacci sequence

" "
"

#the method We know to solve this issue  ----recursion

def fib (n):
    if n ==1 or n ==2: return
        1
    else:
        Retu RN Fib (n-1) + fib (n-2)
n = ten
print "Fibonacci sequence the value of%d is:"% N,FIB (n)

# somewhat meaning

def fibv2 ( N):
    a,b =1,1
    for I in Range (n-1):  # if n = ten then 10-1 = 9 Range (9), recursion 9 times
        a,b= B,a+b
 # ...
        print ' a= ', A, ' b= ', b return
    a
print Fibv2 (Ten) "" "
Fibonacci sequence value:  55
a= 1 b= 2
a= 2 b= 3
a= 3 b= 5
a= 5 b= 8
a= 8 b=
a= b= a= a b= a= 34 b=
a= b= "" "