Data commit

Task/Fibonacci-sequence/MATLAB/fibonacci-sequence-1.m

@@ -0,0 +1,6 @@
+function f = fib(n)
+	
+	f = [1 1 ; 1 0]^(n-1);
+	f = f(1,1);
+	
+end

Task/Fibonacci-sequence/MATLAB/fibonacci-sequence-2.m

@@ -0,0 +1,16 @@
+function F = fibonacci(n)
+
+    Fn = [1 0]; %Fn(1) is F_{n-2}, Fn(2) is F_{n-1}
+    F = 0; %F is F_{n}
+
+    for i = (1:abs(n))
+        Fn(2) = F;
+        F = sum(Fn);
+        Fn(1) = Fn(2);
+    end
+
+    if n < 0
+        F = F*((-1)^(n+1));
+    end
+
+end

Task/Fibonacci-sequence/MATLAB/fibonacci-sequence-3.m

@@ -0,0 +1,13 @@
+function number = fibonacci2(n)
+
+    if n == 1
+        number = 1;
+    elseif n == 0
+        number = 0;
+    elseif n < 0
+        number = ((-1)^(n+1))*fibonacci2(-n);;
+    else
+        number = det(gallery('dramadah',n,3));
+    end
+
+end

Task/Fibonacci-sequence/MATLAB/fibonacci-sequence-4.m

@@ -0,0 +1,12 @@
+function number = fibonacci(n)
+%construct the Tartaglia/Pascal Triangle
+    pt=tril(ones(n));
+    for r = 3 : n
+    % Every element is the addition of the two elements
+    % on top of it. That means the previous row.
+        for c = 2 : r-1
+            pt(r, c) = pt(r-1, c-1) + pt(r-1, c);
+        end
+    end
+    number=trace(rot90(pt));
+end