@axiom it is O(1) as the size of n is independent of the time it takes for the program to return the nth Fibonacci number. If n=1 or n=10,000, it will return the answer in the same amount of time.
Why is this step necessary? mathstodon.xyz might not be the server where you are registered, so we need to redirect you to your home server first.
Don't have an account? You can sign up here