Answers for "fibonacci numbers"

Java

fibonacci

# Easy fibonacci exercise
# Method #1
def fibonacci(n):
    # 1th: 0
    # 2th: 1
    # 3th: 1 ...
    if n == 1:
        return 0
    elif n == 2:
        return 1
    else:
        return fibonacci(n - 1) + fibonacci(n - 2)

# Method #2
def fibonacci2(n):
    if n == 0: return 0
    n1 = 1
    n2 = 1
    # (1, n - 2) because start by 1, 2, 3... not 0, 1, 1, 2, 3....
    for i in range(1, n - 2):
        n1 += n2
        n2 = n1 - n2
    return n1


print(fibonacci(13))
# return the nth element in the fibonacci sequence

Posted by: Guest on January-01-2021

fibonacci numbers

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, ...

Posted by: Guest on December-16-2020

Source

fibonacci sequence

def fibonacci(n):
    if n <= 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fibonacci(n-1) + fibonacci(n-2)

Posted by: Guest on January-03-2021

fibinachi

def fib(n):
  lisp = []
  
  for i in range(n):
    if len(lisp) < 3:
      if len(lisp) == 0:
        lisp.append(0)
      else:
        lisp.append(1)
    
    else:
      lisp.append(lisp[len(lisp)-1]+lisp[len(lisp)-2])
  
  return lisp

Posted by: Guest on October-13-2020

fibonacci numbers

f(n) = f(n-1) + f(n-2) 
                                  f(6)
                                   ^
  			                       /\
                f(5)               +                       f(4)
                ^
               /\                                           /\
                
        f(4)    +           f(3)                     f(3)    +    f(2)
       ^                       ^                     ^              ^
      /\                       /\                    /\            /\
   
 f(3)   +       f(2)            f(2) +f(1)       f(2) + f(1)   f(1) +  f(0)             
   ^              ^                ^                ^
   /\             /\                /\              /\
    
f(2) + f(1)      f(1) +  f(0)     f(1)+ f(0)       f(1) + f(0)         
  ^
  /\
f(1) +  f(0) 
  
//f(6) = 8   ==>  f(1)*8    f(1) appears 8 times 
 double feb  = (1/Math.pow(5,0.5)) * (Math.pow((1+Math.pow(5,0.5))/2,n)) - (1/Math.pow(5,0.5))* (Math.pow((1-Math.pow(5,0.5))/2,n));  
  
f(1) == 1;

Posted by: Guest on August-01-2021

fibbonaci numbers

//using dp, top -down approach memoization
#include <iostream>

using namespace std;
int arr[1000];
int fib(int n)
{
    if(arr[n]==0)
    {
        if(n<=1)
        {
            arr[n]=n;
        }
        else
        {
            arr[n]=fib(n-1)+fib(n-2);
        }
    }
    return arr[n];
}

int main()
{
    int n;
    cout<<"enter the value of which fibonacci value you want to calculate:"<<endl;
    cin>>n;
    int f=fib(n);
    cout<<"fib value is: "<<f<<endl;
    return 0;
}

Posted by: Guest on May-28-2021

Code answers related to "fibonacci numbers"

Code answers related to "Java"

Java Answers by Framework

Browse Popular Code Answers by Language

Python

Javascript

Whatever

Shell/Bash

CSS

Html

PHP

SQL

Java

Answers for "fibonacci numbers"

Code answers related to "fibonacci numbers"

Code answers related to "Java"

Java Answers by Framework

Browse Popular Code Answers by Language

Popular Programming Languages

Advertisements

Company

Compilers

Help

Connect with us