#55 Coding- Find factorial of any given number in javascript

What is Factorial?

Before we jump into coding, let's quickly understand what a factorial is. The factorial of a non-negative integer 'n', denoted by n!, is the product of all positive integers less than or equal to 'n'.

For example:

• 5! = 5 × 4 × 3 × 2 × 1 = 120
• 3! = 3 × 2 × 1 = 6
• 0! is defined as 1 (this is an important base case!).

Method 1: Iterative Approach (Using a Loop)

The most straightforward way to calculate a factorial is using an iterative approach, typically with a for loop. We'll start with a result of 1 and multiply it by each number from 1 up to the given number.

Code Example (Iterative):

function findFactorialIterative(n) {
  if (n < 0) {
    return "Factorial is not defined for negative numbers.";
  }
  if (n === 0) {
    return 1; // Base case for 0!
  }

  let result = 1;
  for (let i = 1; i <= n; i++) {
    result *= i; // Multiply result by current number
  }
  return result;
}

console.log(findFactorialIterative(5)); // Output: 120
console.log(findFactorialIterative(0)); // Output: 1
console.log(findFactorialIterative(3)); // Output: 6
console.log(findFactorialIterative(-4)); // Output: Factorial is not defined for negative numbers.

Explanation:

• We handle negative numbers and the 0! case first.
• We initialize result to 1.
• The loop runs from 1 to n, multiplying result by each i.

Method 2: Recursive Approach

Recursion is another elegant way to solve the factorial problem. A recursive function calls itself until it reaches a base case.

Code Example (Recursive):

function findFactorialRecursive(n) {
  if (n < 0) {
    return "Factorial is not defined for negative numbers.";
  }
  if (n === 0) {
    return 1; // Base case: 0! = 1
  }
  // Recursive step: n! = n * (n-1)!
  return n * findFactorialRecursive(n - 1);
}

console.log(findFactorialRecursive(5)); // Output: 120
console.log(findFactorialRecursive(0)); // Output: 1
console.log(findFactorialRecursive(3)); // Output: 6
console.log(findFactorialRecursive(-4)); // Output: Factorial is not defined for negative numbers.

Explanation:

• Again, we handle negative numbers and the 0! base case.
• For any n > 0, the function returns n multiplied by the factorial of n-1. This process continues until n becomes 0.

Which Method to Choose?

Both methods correctly calculate the factorial. The iterative approach is generally preferred for its clarity and efficiency, as it avoids the overhead of function calls inherent in recursion. However, the recursive solution often reflects the mathematical definition more directly and can be very elegant for certain problems.

Conclusion

And there you have it! We've successfully implemented two common ways to find the factorial of a number in JavaScript. Understanding both iterative and recursive approaches is crucial for becoming a versatile developer. Keep practicing, and stay tuned for our next coding challenge!