Done from section 8

Author: dmakwt

8-section-recursion-problem-set/factorial.js

@@ -0,0 +1,11 @@
+const factorial = (num) => {
+  if (num < 0) {
+    return 0;
+  }
+
+  if (num === 1) return 1;
+
+  return num * factorial(num - 1);
+};
+
+console.log(factorial(7));

8-section-recursion-problem-set/fib.js

@@ -0,0 +1,8 @@
+// Fibonacci sequence
+const fib = (num) => {
+  if (num <= 2) {
+    return 1;
+  }
+
+  return fib(num - 1) + fib(num - 2);
+};

8-section-recursion-problem-set/power.js

@@ -0,0 +1,9 @@
+const power = (base, exponent) => {
+  if (exponent === 0) {
+    return 1;
+  }
+
+  return base * power(base, --exponent);
+};
+
+console.log(power(2, 4));

8-section-recursion-problem-set/productOfArray.js

@@ -0,0 +1,9 @@
+const productOfArray = (arr) => {
+  if (arr.length === 0) {
+    return 1;
+  }
+
+  return arr[0] * productOfArray(arr.slice(1));
+};
+
+console.log(productOfArray([1, 2, 3]));

8-section-recursion-problem-set/recursiveRange.js

@@ -0,0 +1,9 @@
+const recursiveRange = (num) => {
+  if (num === 0) {
+    return 0;
+  }
+
+  return num + recursiveRange(num - 1);
+};
+
+console.log(recursiveRange(6));