llama-4-maverick-03-26-experimental· Meta LMArena Human Preference 140K
write a code that find fribonatci numbers
- User
write a code that find fribonatci numbers
- Assistant
Fibonacci Numbers Generator
The Fibonacci sequence is a series of numbers where a number is the addition of the last two numbers, starting with 0 and 1.
Code (Python)
def fibonacci(n): """ Generate Fibonacci numbers up to the nth number. Args: n (int): The position of the Fibonacci number to generate. Returns: list: A list of Fibonacci numbers up to the nth number. """ fib_sequence = [0, 1] while len(fib_sequence) < n: fib_sequence.append(fib_sequence[-1] + fib_sequence[-2]) return fib_sequence[:n] def fibonacci_recursive(n): """ Calculate the nth Fibonacci number using recursion. Args: n (int): The position of the Fibonacci number to calculate. Returns: int: The nth Fibonacci number. """ if n <= 0: return 0 elif n == 1: return 1 else: return fibonacci_recursive(n-1) + fibonacci_recursive(n-2) def fibonacci_memoization(n, memo={}): """ Calculate the nth Fibonacci number using memoization. Args: n (int): The position of the Fibonacci number to calculate. memo (dict, optional): A dictionary to store previously calculated Fibonacci numbers. Defaults to {}. Returns: int: The nth Fibonacci number. """ if n <= 0: return 0 elif n == 1: return 1 elif n not in memo: memo[n] = fibonacci_memoization(n-1, memo) + fibonacci_memoization(n-2, memo) return memo[n] # Example usage if __name__ == "__main__": n = 10 # Change this to generate Fibonacci numbers up to a different position print("Fibonacci sequence (iterative):") print(fibonacci(n)) print("\nFibonacci sequence (recursive):") for i in range(n): print(f"F({i}) = {fibonacci_recursive(i)}") print("\nFibonacci sequence (memoization):") for i in range(n): print(f"F({i}) = {fibonacci_memoization(i)}")Explanation
This code provides three functions to generate or calculate Fibonacci numbers:
fibonacci(n): An iterative function that generates Fibonacci numbers up to the nth number and returns them as a list. This approach is efficient for large values ofn.fibonacci_recursive(n): A recursive function that calculates the nth Fibonacci number. Although straightforward, this method is less efficient due to repeated calculations, making it less suitable for largen.fibonacci_memoization(n, memo={}): A function that uses memoization (caching previously calculated values) to efficiently calculate the nth Fibonacci number recursively. This approach balances readability with performance.
Time Complexity Analysis
fibonacci(n): O(n) - Linear time complexity because it involves a single loop.fibonacci_recursive(n): O(2^n) - Exponential time complexity due to the repeated computation of the same Fibonacci numbers.fibonacci_memoization(n): O(n) - Linear time complexity since each Fibonacci number is calculated only once and stored for future reference.
Example Output (n=10)
Fibonacci sequence (iterative): [0, 1, 1, 2, 3, 5, 8, 13, 21, 34] Fibonacci sequence (recursive): F(0) = 0 F(1) = 1 F(2) = 1 F(3) = 2 F(4) = 3 F(5) = 5 F(6) = 8 F(7) = 13 F(8) = 21 F(9) = 34 Fibonacci sequence (memoization): F(0) = 0 F(1) = 1 F(2) = 1 F(3) = 2 F(4) = 3 F(5) = 5 F(6) = 8 F(7) = 13 F(8) = 21 F(9) = 34Choose the iterative or memoization approach for efficiency, especially with larger values of
n. The recursive method is more educational but less practical for large sequences.
Other models, same or similar prompt
Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.