Initial data commit

Task/Fibonacci-sequence/JavaScript/fibonacci-sequence-1.js

@@ -0,0 +1,3 @@
+function fib(n) {
+  return n<2?n:fib(n-1)+fib(n-2);
+}

Task/Fibonacci-sequence/JavaScript/fibonacci-sequence-10.js

@@ -0,0 +1,22 @@
+(() => {
+    'use strict';
+
+    // fib :: Int -> Int
+    let fib = n => range(1, n)
+        .reduce(([a, b]) => [b, a + b], [0, 1])[0];
+
+
+    // GENERIC [m..n]
+
+    // range :: Int -> Int -> [Int]
+    let range = (m, n) =>
+        Array.from({
+            length: Math.floor(n - m) + 1
+        }, (_, i) => m + i);
+
+
+    // TEST
+    return fib(32);
+
+    // --> 2178309
+})();

Task/Fibonacci-sequence/JavaScript/fibonacci-sequence-2.js

@@ -0,0 +1,3 @@
+function fib(n) {
+ if (n<2) { return n; } else { return fib(n-1)+fib(n-2); }
+}

Task/Fibonacci-sequence/JavaScript/fibonacci-sequence-3.js

@@ -0,0 +1,5 @@
+function fib(n) {
+  return function(n,a,b) {
+    return n>0 ? arguments.callee(n-1,b,a+b) : a;
+  }(n,0,1);
+}

Task/Fibonacci-sequence/JavaScript/fibonacci-sequence-4.js

@@ -0,0 +1,10 @@
+function fib(n) {
+  var a = 0, b = 1, t;
+  while (n-- > 0) {
+    t = a;
+    a = b;
+    b += t;
+    console.log(a);
+  }
+  return a;
+}

Task/Fibonacci-sequence/JavaScript/fibonacci-sequence-5.js

@@ -0,0 +1,7 @@
+var fib = (function(cache){
+    return cache = cache || {}, function(n){
+        if (cache[n]) return cache[n];
+        else return cache[n] = n == 0 ? 0 : n < 0 ? -fib(-n)
+            : n <= 2 ? 1 : fib(n-2) + fib(n-1);
+    };
+})();

Task/Fibonacci-sequence/JavaScript/fibonacci-sequence-6.js

@@ -0,0 +1,17 @@
+(function () {
+    'use strict';
+
+    function fib(n) {
+        return Array.apply(null, Array(n + 1))
+            .map(function (_, i, lst) {
+                return lst[i] = (
+                    i ? i < 2 ? 1 :
+                    lst[i - 2] + lst[i - 1] :
+                    0
+                );
+            })[n];
+    }
+
+    return fib(32);
+
+})();

Task/Fibonacci-sequence/JavaScript/fibonacci-sequence-7.js

@@ -0,0 +1,17 @@
+function Y(dn) {
+    return (function(fn) {
+        return fn(fn);
+    }(function(fn) {
+        return dn(function() {
+            return fn(fn).apply(null, arguments);
+        });
+    }));
+}
+var fib = Y(function(fn) {
+    return function(n) {
+        if (n === 0 || n === 1) {
+            return n;
+        }
+        return fn(n - 1) + fn(n - 2);
+    };
+});

Task/Fibonacci-sequence/JavaScript/fibonacci-sequence-8.js

@@ -0,0 +1,10 @@
+function* fibonacciGenerator() {
+    var prev = 0;
+    var curr = 1;
+    while (true) {
+        yield curr;
+        curr = curr + prev;
+        prev = curr - prev;
+    }
+}
+var fib = fibonacciGenerator();

Task/Fibonacci-sequence/JavaScript/fibonacci-sequence-9.js

@@ -0,0 +1,35 @@
+(() => {
+    'use strict';
+
+    // Nth member of fibonacci series
+
+    // fib :: Int -> Int
+    function fib(n) {
+        return mapAccumL(([a, b]) => [
+            [b, a + b], b
+        ], [0, 1], range(1, n))[0][0];
+    };
+
+    // GENERIC FUNCTIONS
+
+    // mapAccumL :: (acc -> x -> (acc, y)) -> acc -> [x] -> (acc, [y])
+    let mapAccumL = (f, acc, xs) => {
+        return xs.reduce((a, x) => {
+            let pair = f(a[0], x);
+
+            return [pair[0], a[1].concat(pair[1])];
+        }, [acc, []]);
+    }
+
+    // range :: Int -> Int -> Maybe Int -> [Int]
+    let range = (m, n) =>
+        Array.from({
+            length: Math.floor(n - m) + 1
+        }, (_, i) => m + i);
+
+
+    // TEST
+    return fib(32);
+
+    // --> 2178309
+})();