Skip to content
TheChatArchiveThe Chat Archive
Mistralmagistral-medium-2506· Mistral AIHugging Face LMArena Human Preference 140K

Create a Python function implementing recursive Fibonacci sequence calculation

From a Chatbot Arena battleThe same person sent this prompt to two anonymous models at once. Compare it with o3-2025-04-16’s answer.
  1. User

    Create a Python function implementing recursive Fibonacci sequence calculation

  2. Mistral Assistant

    Here's a Python function that implements the recursive calculation of the Fibonacci sequence:

    def fibonacci(n):
        if not isinstance(n, int) or n < 0:
            raise ValueError("Input should be a non-negative integer")
        if n == 0:
            return 0
        elif n == 1:
            return 1
        else:
            return fibonacci(n-1) + fibonacci(n-2)
    
    def test_fibonacci():
        assert fibonacci(0) == 0
        assert fibonacci(1) == 1
        assert fibonacci(2) == 1
        assert fibonacci(3) == 2
        assert fibonacci(4) == 3
        assert fibonacci(5) == 5
        assert fibonacci(10) == 55
        try:
            fibonacci(-1)
            assert False, "Expected an exception for negative input"
        except ValueError:
            pass
        print("All tests passed!")
    
    test_fibonacci()
    

    This function uses recursion to calculate the nth Fibonacci number. It includes checks for invalid inputs and handles the base cases where n is 0 or 1. The test function verifies that the implementation works correctly for various inputs, including edge cases.

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.