Calculating Fibonacci Sequence Using Lambda Functions

You can calculate the Fibonacci sequence using simple logic and recursion with lambda functions.

The Fibonacci sequence is a sequence where each number is the sum of the two preceding ones, starting from 0 and 1, following the pattern 0, 1, 1, 2, 3, 5, 8....

You can recursively calculate the Fibonacci sequence using a lambda expression as shown below.

Copy
# Lambda function to calculate Fibonacci sequence
fib = lambda x: x if x <= 1 else fib(x-1) + fib(x-2)

# 5 (5th value in 0, 1, 1, 2, 3, 5)
print(fib(5))
# 55
print(fib(10))

The fib lambda function in the code operates as follows:

• x if x <= 1: Returns x when x is less than or equal to 1

• else fib(x-1) + fib(x-2): For other cases, returns fib(x-1) + fib(x-2)

Using a lambda function allows you to implement the Fibonacci sequence in a concise, single-line expression.