DEV Community 👩‍💻👨‍💻

Cover image for Fibonacci Sequence Function
Scott Gordon
Scott Gordon

Posted on

Fibonacci Sequence Function

#   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:
            temp = first + second
            first = second
            second = temp
            counter += 1



Enter fullscreen mode Exit fullscreen mode

Photo by Ludde Lorentz on Unsplash

Top comments (5)

mccurcio profile image
Matt Curcio

Yes, but can you do it with recursion? hehe

sagordondev profile image
Info Comment hidden by post author - thread only accessible via permalink
Scott Gordon Author

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_918 profile image
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)
Enter fullscreen mode Exit fullscreen mode

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

joaomcteixeira profile image
João M.C. Teixeira

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

sagordondev profile image
Scott Gordon Author

Awesome thanks!

Some comments have been hidden by the post's author - find out more

🌚 Browsing with dark mode makes you a better developer.

It's a scientific fact.