Python script to minimize unimodal expressions using Fibonacci method

fibonacci-method.py

import math
def fibu(n):  
   if n <= 1:  
       return n  
   else:  
       return(fibu(n-1) + fibu(n-2))

#for i in range (10):
#    print (i-1, ",", fibu(i))

def L(k):
    '''
    print (7-k+1)
    print (fibu(7 - k + 2  ))
    print ((fibu( 7 + 2) ))
    print (l)
    print (n) '''
    res = ( fibu(n - k + 1 + 1) / fibu( n + 2) ) * l
    return res

def fibmethod (f, a, b, k, count):
    count += 1
    l_res = L(k)
    k = k + 1
    x1 = a + l_res
    x2 = b - l_res
    print ("n =", count)
    print ("x1 =", x1, "x2 =", x2, "\nL =", l_res)
    fx1 = f(x1)
    fx2 = f(x2)
    print ("fx1 =", fx1, "\nfx2 = ", fx2)
    if (count == 6):
        return 0
    if (fx1 < fx2):
        print ("new interval = [", a, ",", x2, "]\n")
        return fibmethod (f, a, x2, k, count)
    else:
        print ("new interval = [", x1, ",", b, "]\n")        
        return fibmethod (f, x1, b, k, count)

# functino goes here
f = lambda x:
# interval
a = -5
b = 0

l = b - a
k = 2
n = 6
count=0
print (fibmethod (f, a, b, k, count))