Answers for "fibonnaci python"

10

fibonacci sequence python

# WARNING: this program assumes the
# fibonacci sequence starts at 1
def fib(num):
	"""return the number at index `num` in the fibonacci sequence"""
    if num <= 2:
        return 1
    return fib(num - 1) + fib(num - 2)

# method 2: use `for` loop
def fib2(num):
	a, b = 1, 1
	for _ in range(num - 1):
		a, b = b, a + b
	return a


print(fib(6))  # 8
print(fib2(6))  # same result, but much faster
Posted by: Guest on February-24-2020
1

fibonacci python

# Implement the fibonacci sequence
	# (0, 1, 1, 2, 3, 5, 8, 13, etc...)
	def fib(n):
		if n== 0 or n== 1:
			return n
		return fib (n- 1) + fib (n- 2)
Posted by: Guest on May-03-2021
2

python fibonacci

def Fibonacci( pos ):
        #check for the terminating condition
        if pos <= 1 :
                #Return the value for position 1, here it is 0
                return 0
        if pos == 2:
                #return the value for position 2, here it is 1
                return 1
 
        #perform some operation with the arguments
        #Calculate the (n-1)th number by calling the function itself
        n_1 = Fibonacci( pos-1 )
 
        #calculation  the (n-2)th number by calling the function itself again
        n_2 = Fibonacci( pos-2 )
 
        #calculate the fibo number
        n = n_1 + n_2
 
        #return the fibo number
        return n
 
#Here we asking the function to calculate 5th Fibonacci
nth_fibo = Fibonacci( 5 ) 
 
print (nth_fibo)
Posted by: Guest on April-19-2021
1

fibonacci sequence python

num = 1
num1 = 0
num2 = 1
import time
for i in range(0, 10):
    print(num)
    num = num1 + num2
    num1 = num2
    num2 = num
    time.sleep(1)
Posted by: Guest on October-02-2020
5

fibonacci series in python

# Program to display the Fibonacci sequence up to n-th term

nterms = int(input("How many terms? "))

# first two terms
n1, n2 = 0, 1
count = 0

# check if the number of terms is valid
if nterms <= 0:
   print("Please enter a positive integer")
elif nterms == 1:
   print("Fibonacci sequence upto",nterms,":")
   print(n1)
else:
   print("Fibonacci sequence:")
   while count < nterms:
       print(n1)
       nth = n1 + n2
       # update values
       n1 = n2
       n2 = nth
       count += 1
Posted by: Guest on May-12-2020
0

fibonacci python

# This function computes and returns fibonacci 
# sequence number using Dynamic Programming
def fib(num, memo{}):
	if num in memo:
	    return memo[num]
	if num <= 2:
      return 1
    
   	memo[n] = fib(num-1, memo) + fib(num-2, memo)
    return memo[n]
	
  	"""
	  	params:
	    	int num: index of fibonacci sequence
	        dict memo: This object is needed to perform dynamic programming. Leave it empty
        return:
        	int output.
        complexity:
        	time: O(n)
            memory: O(n)
  	"""
Posted by: Guest on October-12-2021

Python Answers by Framework

Browse Popular Code Answers by Language