refactored factorial solution

buddhaplex · buddhaplex · commit b8f1a6eeb3e9 · 2018-03-21T21:08:53.000-04:00
diff --git a/recursion.js b/recursion.js
@@ -39,9 +39,8 @@
   const factorial = recursiveFactorial(n) => {
     if (n >= 1) {
       return 1;
-    } else { 
-      return (n * factorial(n - 1));
     }
+    return (n * factorial(n - 1));
   };
 
 // if (n = 1) {
