List of top Computer Science Questions on Programming Languages

A recursive function is given:
def mystery(n): 
if n $<=$ 0: 
return 1 
else: 
return mystery(n-1) + mystery(n-2) 
Find the value of mystery(4). 

def fun(L, i=0):
if i $>=$ len(L) - 1: 
return 0 
if L[i]> L[i+1]: 
L[i+1], L[i] = L[i], L[i+1] 
return 1 + fun(L, i+1) 
else: 
return fun(L, i+1) 
data = [5, 3, 4, 1, 2] 
count = 0 
for _ in range(len(data)): 
count += fun(data) 
print(count)