Open essepuntato opened 1 year ago
# Test case for the algorithm
def test_fib(int_1, expected):
result = fib(int_1)
if result == expected:
return True
else:
return False
# Code for the algorithm
def fib(n):
if n <= 0:
return 0
if n ==1:
return 1
else:
return fib(n-1)+fib(n-2)
# Three test runs
print(test_fib(2, 1))
print(test_fib(16, 987))
print(test_fib(24, 46368))
# Console results
True
True
True
def test_fib(n, expected):
result = fib(n)
if expected == result:
return True
else:
return False
def fib(n):
if n <= 0:
return 0
if n == 1:
return 1
else:
return fib(n-1) + fib(n-2)
print(test_fib(1,1))
print(test_fib(2,1))
print(test_fib(6, 8))
print(test_fib(0,0))
def test_my_fib(n, expected):
result = fib(n)
if result == expected:
return True
else:
return False
def fib(n):
if n <= 0:
return 0
elif n == 1:
return 1
else:
return fib(n-1) + fib(n-2)
print(test_my_fib(19, 4181))
print(test_my_fib(22, 17711))
print(test_my_fib(4, 3))
#Console output
True
True
True
def test_fibonacci(n,expected):
if fibonacci(n) == expected:
return True
else:
return False
def fibonacci(n):
if n <= 0:
result = 0
elif n == 1:
result = 1
else:
result = fibonacci(n-1) + fibonacci(n-2)
return result
print(test_fibonacci(0,0)) #True
print(test_fibonacci(1,1)) #True
print(test_fibonacci(4,3)) #True
print(test_fibonacci(7,13)) #True
def fib(n):
# n can't be less than 0
if n == 0 or n == 1:
return n
return fib(n - 1) + fib(n - 2)
def test_fib(n, expected):
if fib(n) == expected:
return True
return False
print(test_fib(0, 0))
print(test_fib(1, 1))
print(test_fib(2, 1))
print(test_fib(4, 3))
print(test_fib(12, 144))
print(test_fib(19, 4181))
def test_fib(n, expected):
result = fib(n)
if expected == result:
return True
else:
return False
def fib(n):
if n <= 0:
return 0
if n == 1:
return 1
else:
return fib(n-1)+fib(n-2)
print(test_fib(0, 0))
print(test_fib(1, 1))
print(test_fib(-1, 0))
print(test_fib(2, 1))
print(test_fib(12, 144))
# Define Test Algorithm
def test_fib(n, expected):
result= fib(n)
if result==expected:
return True
else:
return False
# Code of Fibonacci Seuquence Algorithm
def fib(n):
if n<=0:
return 0
elif n==1:
return 1
else:
return fib(n-1) + fib (n-2)
# Five Test runs
print (test_fib(6, 8))
print (test_fib(11, 89))
print (test_fib( 0, 0))
print (test_fib( 1, 1))
print (test_fib(-5, 0 ))
def test_fib(n, expected):
result = fib(n)
if result == expected:
return True
else:
return False
def fib(n):
if n <= 0:
return 0
elif n == 1:
return 1
else:
return fib(n-1) + fib(n-2)
print(test_fib(1, 1))
print(test_fib(2, 1))
print(test_fib(4, 3))
print(test_fib(11, 89))
def test_fib(n, expected):
result = fib(n)
if expected == result:
return True
else:
return False
def fib(n):
if n <= 0:
return 0
if n == 1:
return 1
else:
return fib(n-1) + fib(n-2)
# Test runs that returns True
print(test_fib(0, 0))
print(test_fib(1, 1))
print(test_fib(2, 1))
print(test_fib(3, 2))
print(test_fib(7, 13))
def test_fib(n, expected):
result = fib(n)
if result == expected:
return True
else:
return False
def fib(n):
if n <= 0:
return 0
elif n == 1:
return 1
else:
return fib(n-1)+fib(n-2)
print(test_fib(3, 2))
print(test_fib(0, 0))
print(test_fib(9, 34))
def test_fib(n, expected):
return expected == fib(n)
def fib(n):
if n <= 0:
return 0
elif n == 1:
return 1
else:
return fib(n-1) + fib(n-2)
print(test_fib(7, 13)) # True
print(test_fib(13, 233)) # True
print(test_fib(0, 0)) # True
def test_fib(n, expected):
result=fib(n)
if result==expected:
return True
else:
return False
def fib(n):
if n <= 0:
return 0
elif n == 1:
return 1
else:
return fib(n-1) + fib(n-2)
print(test_fib(10, 55))
print(test_fib(1, 1))
print(test_fib(0, 0))
print(test_fib(4, 3))
True
True
True
True
def test_fib(n, expected):
result = fib(n)
if result == expected:
return True
else:
return False
def fib(n):
if n <= 0:
return 0
if n == 1:
return 1
else:
return fib(n-1) + fib(n-2)
print(test_fib(5, 5))
print(test_fib(7, 13))
print(test_fib(8, 21))
print(test_fib(9, 34))
# Test case for the algorithm
def test_fib(int_1, expected):
result = fib(int_1)
if result == expected:
return True
else:
return False
# Code for the algorithm
def fib(n):
if n <= 0:
return 0
if n ==1:
return 1
else:
return fib(n-1)+fib(n-2)
# Three test runs
print(test_fib(2, 1)) #True
print(test_fib(1, 1)) #True
print(test_fib(4, 3)) #True
def test_fib(n,expected):
if fib(n) == expected:
return True
else:
return False
def fib(n):
if n <= 0:
result = 0
elif n == 1:
result = 1
else:
result = fib(n-1) + fib(n-2)
return result
print(test_fib(5, 5))
print(test_fib(2, 1))
print(test_fib(7, 13))
Define a recursive function
def fib(n)
that implements the algorithm to find the nthe Fibonacci number. In particular, ifn
is less than or equal to 0, then 0 is returned as a result. Otherwise, ifn
is equal to 1, then 1 is returned. Otherwise, return the sum of the same function called withn-1
andn-2
as input. Please accompany the function with the related test case.