How can recursive calls be optimized to improve their efficiency?

In Swift, one of the commonly used structures in the standard library is Array — an ordered collection of elements of the same type.

Example of usage:

var numbers: [Int] = [1, 2, 3, 4, 5]
numbers.append(6) // Adding an element
print(numbers) // Will output: [1, 2, 3, 4, 5, 6]

Additionally, the Dictionary structure is used for storing key-value pairs, and Set is for unique elements without a specific order.