Data commit

Task/Sum-of-a-series/JavaScript/sum-of-a-series-1.js

@@ -0,0 +1,7 @@
+function sum(a,b,fn) {
+   var s = 0;
+   for ( ; a <= b; a++) s += fn(a);
+   return s;
+}
+
+ sum(1,1000, function(x) { return 1/(x*x) } )  // 1.64393456668156

Task/Sum-of-a-series/JavaScript/sum-of-a-series-2.js

@@ -0,0 +1,25 @@
+(function () {
+
+  function sum(fn, lstRange) {
+    return lstRange.reduce(
+      function (lngSum, x) {
+        return lngSum + fn(x);
+      }, 0
+    );
+  }
+
+  function range(m, n) {
+    return Array.apply(null, Array(n - m + 1)).map(function (x, i) {
+      return m + i;
+    });
+  }
+
+
+  return sum(
+    function (x) {
+      return 1 / (x * x);
+    },
+    range(1, 1000)
+  );
+
+})();

Task/Sum-of-a-series/JavaScript/sum-of-a-series-3.js

@@ -0,0 +1 @@
+1.6439345666815615

Task/Sum-of-a-series/JavaScript/sum-of-a-series-4.js

@@ -0,0 +1,25 @@
+(() => {
+    'use strict';
+
+    // SUM OF A SERIES -------------------------------------------------------
+
+    // seriesSum :: Num a => (a -> a) -> [a] -> a
+    const seriesSum = (f, xs) =>
+        foldl((a, x) => a + f(x), 0, xs);
+
+
+    // GENERIC ---------------------------------------------------------------
+
+    // enumFromToInt :: Int -> Int -> [Int]
+    const enumFromTo = (m, n) =>
+        Array.from({
+            length: Math.floor(n - m) + 1
+        }, (_, i) => m + i);
+
+    // foldl :: (b -> a -> b) -> b -> [a] -> b
+    const foldl = (f, a, xs) => xs.reduce(f, a);
+
+    // TEST ------------------------------------------------------------------
+
+    return seriesSum(x => 1 / (x * x), enumFromTo(1, 1000));
+})();

Task/Sum-of-a-series/JavaScript/sum-of-a-series-5.js

@@ -0,0 +1 @@
+1.6439345666815615