Optimized Fibonacci number calculator using GDScript

Fibonacci.gd

extends Control

# Fibonacci number calculation using recursion

# This has some optimization where prior numbers are stored in an array
# Also, the array is expanded in size as needed

func _ready():
	# Calculate the nth number and pass in the array to be referenced
	print(fibo(34, [1, 1]))
	#print(slow_fibo(34))


func fibo(n: int, arr: Array):
	if arr.size() <= n:
		n = fibo(n - 1, arr) + fibo(n - 2, arr)
		arr.push_back(n)
	else:
		n = arr[n]
	return n


func slow_fibo(n):
	if n < 2:
		return 1
	return slow_fibo(n - 1) + slow_fibo(n - 2)