fibonacci

Example implementation for Fibonacci sequences.

boring_math.recursive_functions.fibonacci.orderable_generator(fib0: T, fib1: T, forward: bool = True) → Iterator

Generate a Fibonacci sequence

param fib0:

Zeroth numeric element of the sequence.

param fib1:

Next numeric element of the sequence.

param forward:

Generate sequence in forward or reverse order.

yields:

An iterator iterating over a Fibonacci sequence.

Note

• fibonacci.orderable_generator(fib0=0, fib1=1) generates

• the sequence 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89 ...

• fibonacci.orderable_generator(fib0=5, fib1=3, forward = False) generates

• the sequence 5, 3, 2, 1, 1, 0, 1, -1, 2, -3, 5, -8, ...