Data commit

Task/Fibonacci-sequence/Octave/fibonacci-sequence-1.octave

@@ -0,0 +1,8 @@
+% recursive
+function fibo = recfibo(n)
+  if ( n < 2 )
+    fibo = n;
+  else
+    fibo = recfibo(n-1) + recfibo(n-2);
+  endif
+endfunction

Task/Fibonacci-sequence/Octave/fibonacci-sequence-2.octave

@@ -0,0 +1,4 @@
+% testing
+for i = 0 : 20
+  printf("%d %d\n", i, recfibo(i));
+endfor

Task/Fibonacci-sequence/Octave/fibonacci-sequence-3.octave

@@ -0,0 +1,16 @@
+% iterative
+function fibo = iterfibo(n)
+  if ( n < 2 )
+    fibo = n;
+  else
+    f = zeros(2,1);
+    f(1) = 0;
+    f(2) = 1;
+    for i = 2 : n
+      t = f(2);
+      f(2) = f(1) + f(2);
+      f(1) = t;
+    endfor
+    fibo = f(2);
+  endif
+endfunction

Task/Fibonacci-sequence/Octave/fibonacci-sequence-4.octave

@@ -0,0 +1,4 @@
+% testing
+for i = 0 : 20
+  printf("%d %d\n", i, iterfibo(i));
+endfor

Task/Fibonacci-sequence/Octave/fibonacci-sequence-5.octave

@@ -0,0 +1,3 @@
+function retval = fibanalytic(n)
+  retval = round(((5 .^ 0.5 + 1) / 2) .^ n / 5 .^ 0.5);
+endfunction

Task/Fibonacci-sequence/Octave/fibonacci-sequence-6.octave

@@ -0,0 +1,7 @@
+function retval = fibtailrecursive(n, prevfib = 0, fib = 1)
+  if (n == 0)
+    retval = prevfib;
+  else
+    retval = fibtailrecursive(n - 1, fib, prevfib + fib);
+  endif
+endfunction