aershov24

φ = (1+sqrt(5))/2

aershov24

def fib_iterative(n):
    a, b = 0, 1
    while n > 0:
        a, b = b, a + b
        n -= 1
    return a

aershov24

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

aershov24

// |<---    p: F(n-1) - 1    --->|
// |<----- q ----->|   |<-- r -->|
// +----+---+------+---+---------+
// |    | k |      | m |         |
// +----+---+------+---+---------+

aershov24

function fib(n) {
    if (n <= 0)
        return 0;
    if (n <= 2)
        return 1;
    return fib(n-1) + fib(n-2);
}

function smallest_greater_eq_fib(n) {
    let f = fib(0),

aershov24

class Solution:
    def fib(self, N: int) -> int:
        if (N <= 1):
            return N

        A = [[1, 1], [1, 0]]
        self.matrix_power(A, N-1)

        return A[0][0]

aershov24

function fib(n){
  if (n === 1) return 0;
  if (n === 2) return 1; 
  return fib(n — 1) + fib(n — 2);
}

aershov24

def fib_formula(n):
    golden_ratio = (1 + math.sqrt(5)) / 2
    val = (golden_ratio**n - (1 - golden_ratio)**n) / math.sqrt(5)
    return int(round(val))

aershov24

function * iterableObj() {
  yield 'This';
  yield 'is';
  yield 'iterable.'
}
for (const val of iterableObj()) {
  console.log(val);
}
// This
// is 

aershov24

public class Fibonacci_Search 
{
    static int kk = -1, nn = -1;
    static int fib[] = { 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233,
            377, 610, 98, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368,
            75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309,
            3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986,
            102334155, 165580141 };
 
    static int fibsearch(int a[], int n, long x)