How to useRecursion in Javascript
In this approach, we use a recursive function to repeatedly add the last digit of the number (obtained using modulo 10) and call itself with the number divided by 10 until the number becomes 0.
Example: In this example, the recursiveSum function calls itself with the number divided by 10, adding the last digit each time, until the number becomes 0.
function recursiveSum(num) {
if (num === 0) {
return 0;
}
return (num % 10) + recursiveSum(Math.floor(num / 10));
}
console.log(recursiveSum(738));
Output
18
JavaScript Program for Sum of Digits of a Number
In this article, we are going to learn about finding the Sum of Digits of a number using JavaScript. The Sum of Digits refers to the result obtained by adding up all the individual numerical digits within a given integer. It’s a basic arithmetic operation. This process is repeated until a single-digit sum, also known as the digital root.
There are several methods that can be used to find the Sum Of Digits by using JavaScript, which are listed below:
Table of Content
- Approach 1: Using Array Reduce() Method
- Approach 2: Using For…of Loop
- Approach 3: Using Math.floor and Division
- Approach 4: Using forEach
- Approach 5: Using Recursion
We will explore all the above methods along with their basic implementation with the help of examples.
Contact Us