Question 3 (Write a function that takes an array of integers as input. For each integer, output the next fibonacci number. Solution that work both cpu and memory efficient are appreciated.)

answer3.py

import time

def recursiveFibonacci(number, fn1, fn2):
	fnNext = fn1 + fn2
	fn1 = fn2
	if number < fnNext:
		print(fnNext)
	else:
		recursiveFibonacci(number, fn1,fnNext)

def main():
	number = input("Input number (separate number with comma): ")
	arrNum = number.strip().split(",")

	fn1 = 1
	fn2 = 1
	
	start2 = time.time()
	for i in range (len(arrNum)):
		recursiveFibonacci(int(arrNum[i]), fn1, fn2)

	end2 = time.time()
	print("Time Limit Exceeded Recursive: ", end2 - start2)

if __name__ == '__main__':
	main()