Another update from ingydotnet^djgoku

Task/Mutual-recursion/JavaScript/mutual-recursion-1.js

@@ -0,0 +1,19 @@
+function f(num) {
+ return (num === 0) ? 1 : num - m(f(num - 1));
+}
+
+function m(num) {
+ return (num === 0) ? 0 : num - f(m(num - 1));
+}
+
+function range(m, n) {
+  return Array.apply(null, Array(n - m + 1)).map(
+    function (x, i) { return m + i; }
+  );
+}
+
+var a = range(0, 19);
+
+//return a new array of the results and join with commas to print
+console.log(a.map(function (n) { return f(n); }).join(', '));
+console.log(a.map(function (n) { return m(n); }).join(', '));

Task/Mutual-recursion/JavaScript/mutual-recursion-2.js

@@ -0,0 +1,14 @@
+var f = num => (num === 0) ? 1 : num - m(f(num - 1));
+var m = num => (num === 0) ? 0 : num - f(m(num - 1));
+
+function range(m, n) {
+  return Array.apply(null, Array(n - m + 1)).map(
+    function (x, i) { return m + i; }
+  );
+}
+
+var a = range(0, 19);
+
+//return a new array of the results and join with commas to print
+console.log(a.map(n => f(n)).join(', '));
+console.log(a.map(n => m(n)).join(', '));

Task/Mutual-recursion/JavaScript/mutual-recursion.js

@@ -1,19 +0,0 @@
-function F(n)
-{
- return n === 0 ? 1 : n - M(F(n - 1));
-}
-
-function M(n)
-{
- return n === 0 ? 0 : n - F(M(n - 1));
-}
-
-var
- out = {F: [], M: []},
- i;
-for (i = 0; i < 20; i++)
-{
- out.F.push(F(i));
- out.M.push(M(i));
-}
-print(out.F + "\n" + out.M);