Data commit

Task/Fibonacci-sequence/QB64/fibonacci-sequence-1.qb64

@@ -0,0 +1,33 @@
+_DEFINE F AS _UNSIGNED _INTEGER64
+CLS
+PRINT
+PRINT "Enter 40 to more easily see the difference in calculation speeds."
+PRINT
+INPUT "Enter n for Fibonacci(n): ", n
+PRINT
+PRINT " Analytic Method (Fastest): F("; LTRIM$(STR$(n)); ") ="; fA(n)
+PRINT "Iterative Method    (Fast): F("; LTRIM$(STR$(n)); ") ="; fI(n)
+PRINT "Recursive Method    (Slow): F("; LTRIM$(STR$(n)); ") ="; fR(n)
+END
+
+' === Analytic Fibonacci Function (Fastest)
+FUNCTION fA (n)
+  fA = INT(0.5 + (((SQR(5) + 1) / 2) ^ n) / SQR(5))
+END FUNCTION
+
+' === Iterative Fibonacci Function (Fast)
+FUNCTION fI (n)
+  FOR i = 1 TO n
+    IF i < 3 THEN a = 1: b = 1
+    t = fI + b: fI = b: b = t
+  NEXT
+END FUNCTION
+
+' === Recursive Fibonacci function (Slow)
+FUNCTION fR (n)
+  IF n <= 1 THEN
+    fR = n
+  ELSE
+    fR = fR(n - 1) + fR(n - 2)
+  END IF
+END FUNCTION

Task/Fibonacci-sequence/QB64/fibonacci-sequence-2.qb64

@@ -0,0 +1,14 @@
+DIM F(80) AS DOUBLE 'FibRus.bas DANILIN
+F(1) = 0: F(2) = 1
+'OPEN "FibRus.txt" FOR OUTPUT AS #1
+FOR i = 3 TO 80
+    F(i) = F(i-1)+F(i-2)
+NEXT i
+
+FOR i = 1 TO 80
+    f$ = STR$(F(i)): LF = 22 - LEN(f$)
+    n$ = ""
+    FOR j = 1 TO LF: n$ = " " + n$: NEXT
+    f$ = n$ + f$
+    PRINT i, f$: ' PRINT #1, i, f$
+NEXT i