Answers for "fibonachi sequence"

fibbonacci

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811,

fibbonacci

0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811,

fibonacci sequence

public class Numbers {
	public static void FibannaciNumbers(int n) {
        int x = 0;
        int y = 1;
        if(n >= 1) {
            System.out.print(x + " ");
        }
        if(n >= 2) {
            System.out.print(y);
        }
        if (n > 2) {
            for(int a = n - 2; a > 0; a--) {
                int z = y + x;
                System.out.print(" " + z);
                x = y;
                y = z;
            }
        }
    }
}

fibonacci sequence

public class Numbers {
	public static void FibannaciNumbers(int n) {
        int x = 0;
        int y = 1;
        if(n >= 1) {
            System.out.print(x + " ");
        }
        if(n >= 2) {
            System.out.print(y);
        }
        if (n > 2) {
            for(int a = n - 2; a > 0; a--) {
                int z = y + x;
                System.out.print(" " + z);
                x = y;
                y = z;
            }
        }
    }
}

Fibonacci sequence

function myFib(n) {
    if (isNaN(n) || Math.floor(n) !== n)
        return "Not an integer value!";
    if (n === 0 || n === 1)
        return 3;
    else
        return myFib(n - 1) + myFib(n - 2);
}

console.log(myFib(5));

Fibonacci sequence

function myFib(n) {
    if (isNaN(n) || Math.floor(n) !== n)
        return "Not an integer value!";
    if (n === 0 || n === 1)
        return 3;
    else
        return myFib(n - 1) + myFib(n - 2);
}

console.log(myFib(5));

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

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

fibonacci sequence

int n ; 
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));

fibonacci sequence

int n ; 
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));