Find All Factors of a Natural Number using Recursion

We can also use recursion to find the factors of a number. This approach is not the most efficient but can be useful in understanding recursive algorithms.

Javascript




function findFactors(num, current = 1, factors = []) {
    if (current > num) {
        return factors;
    }
    if (num % current === 0) {
        factors.push(current);
    }
    return findFactors(num, current + 1, factors);
}
  
console.log(findFactors(12));


Output

[ 1, 2, 3, 4, 6, 12 ]


JavaScript Program to Find All Factors of a Natural Number

Finding all factors of a natural number is a common task in programming and mathematics. A factor of a number is an integer that can be multiplied by another integer to produce the original number. In this article, we will discuss various approaches to finding all factors of a natural number using JavaScript.

Similar Reads

Find All Factors of a Natural Number using for Loop

The simplest way to find all factors of a number is to iterate from 1 to the number itself and check if the number is divisible by the current iteration index. If it is, then the index is a factor of the number....

Find All Factors of a Natural Number using Optimized Approach

...

Find All Factors of a Natural Number using Recursion

We can optimize the above approach by iterating only up to the square root of the number. This is because if n is a factor of the number, then num/n is also a factor. However, we need to be careful to avoid duplicate factors....