Data update

Task/Fibonacci-sequence/Yabasic/fibonacci-sequence-1.basic

@@ -1,4 +1,6 @@
-sub fibonacci (n)
+sub fibonacciI (n)
+    local n1, n2, k, sum
+
     n1 = 0
     n2 = 1
     for k = 1 to abs(n)
@@ -6,7 +8,7 @@ sub fibonacci (n)
         n1 = n2
         n2 = sum
     next k
-    if n < 0 then
+    if n < 1 then
        return n1 * ((-1) ^ ((-n) + 1))
     else
        return n1

Task/Fibonacci-sequence/Yabasic/fibonacci-sequence-2.basic

@@ -0,0 +1,7 @@
+sub fibonacciR(n)
+    if n <= 1 then
+        return n
+    else
+        return fibonacciR(n-1) + fibonacciR(n-2)
+    end if
+end sub

Task/Fibonacci-sequence/Yabasic/fibonacci-sequence-3.basic

@@ -0,0 +1,3 @@
+sub fibonacciA (n)
+    return int(0.5 + (((sqrt(5) + 1) / 2) ^ n) / sqrt(5))
+end sub

Task/Fibonacci-sequence/Yabasic/fibonacci-sequence-4.basic

@@ -0,0 +1,13 @@
+sub fibonacciB(n)
+    local sq5, phi1, phi2, dn1, dn2, k
+
+    sq5 = sqrt(5)
+    phi1 = (1 + sq5) / 2
+    phi2 = (1 - sq5) / 2
+    dn1 = phi1: dn2 = phi2
+    for k = 0 to n
+        dn1 = dn1 * phi1
+        dn2 = dn2 * phi2
+        print int(((dn1 - dn2) / sq5) + .5);
+    next k
+end sub