Fibonacci Sequence Function

# fibonacci_sequence.py
#   This program computes the nth Fibonacci number where n is a value input
#   by the user using a function.
# by: Scott Gordon

def main():
    print("***** Welcome to the Fibonacci Sequencer *****")

    nterms = int(
        input("Enter a number to represent the number of passes through the"
              "Fibonacci Sequence you want: "))

    def fibonacci_sequence(nterms):

        counter = 0
        first = 0
        second = 1
        temp = 0

        while counter <= nterms:
            print(first)
            temp = first + second
            first = second
            second = temp
            counter += 1

    fibonacci_sequence(nterms)


main()

Photo by Ludde Lorentz on Unsplash

Comments

[Matt Curcio]

Yes, but can you do it with recursion? hehe

[Scott Gordon]

I don't believe I have used recursion for fibonacci as of yet in my studies. I can certainly give it a go later on though!

[Ashish Pandey]

Yes We can do the same with recursion as well.

Code snippet:

def fibonacci_sequence(nterms):

  # Base case
    if nterms == 1:
       return 1
   if nterms == 0:
      return 0

   # recursive call
    return fibonacci_sequence(nterms-1) + fibonacci_sequence(nterms-2)

We can do memomization here as well because here we are doing many rework as well

[João M.C. Teixeira]

Interesting. have a look also here, we were discussing Fibonacci without recursion also

dev.to/joaomcteixeira/fibonacci-wi...

[Scott Gordon]

Awesome thanks!