Fibonacci Module

A Python module for calculating Fibonacci numbers with multiple implementations.

Features

• Iterative Fibonacci: Efficient O(n) time complexity implementation
• Recursive Fibonacci: Classic recursive approach
• Fibonacci Sequence: Generate a list of Fibonacci numbers
• Fibonacci Check: Test if a number is in the Fibonacci sequence

Installation

pip install fibonacci-module

Usage

from fibonacci.fibonacci import fibonacci_iterative, fibonacci_recursive, fibonacci_sequence, is_fibonacci

# Calculate the 10th Fibonacci number iteratively
print(fibonacci_iterative(10))  # Output: 55

# Calculate the 10th Fibonacci number recursively
print(fibonacci_recursive(10))  # Output: 55

# Generate the first 10 Fibonacci numbers
print(fibonacci_sequence(10))  # Output: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

# Check if a number is a Fibonacci number
print(is_fibonacci(13))  # Output: True
print(is_fibonacci(14))  # Output: False

Functions

fibonacci_iterative(n)

Calculate the nth Fibonacci number using an iterative approach.

• Parameters: n (int) - The position in the Fibonacci sequence (0-indexed)
• Returns: int - The nth Fibonacci number
• Raises: ValueError if n is negative

fibonacci_recursive(n)

Calculate the nth Fibonacci number using recursion.

• Parameters: n (int) - The position in the Fibonacci sequence (0-indexed)
• Returns: int - The nth Fibonacci number
• Raises: ValueError if n is negative

fibonacci_sequence(n)

Generate a list of the first n Fibonacci numbers.

• Parameters: n (int) - The number of Fibonacci numbers to generate
• Returns: list - A list containing the first n Fibonacci numbers
• Raises: ValueError if n is negative

is_fibonacci(num)

Check if a number is in the Fibonacci sequence.

• Parameters: num (int) - The number to check
• Returns: bool - True if the number is a Fibonacci number, False otherwise

License

MIT License

Contributing

Contributions are welcome! Please feel free to submit a Pull Request.