Prefix sums (Creating an array with increasing sum) with Recursion in JavaScript

Consider the following array of numbers −

const arr = [10, 5, 6, 12, 7, 1];

The sum of its consecutive elements taking one less element in every go will be −

[10, 5, 6, 12, 7, 1] = 10 + 5 + 6 + 12 + 7 + 1 = 41;
[5, 6, 12, 7, 1] = 5 + 6 + 12 + 7 + 1 = 31;
[6, 12, 7, 1] = 6 + 12 + 7 + 1 = 26;
[12, 7, 1] = 12 + 7 + 1 = 20;
[7, 1] = 7 + 1 = 8;
[1] = 1 = 1;

So, the final output should be an array like this −

[ 41, 31, 26, 20, 8, 1 ]

We are required to write a function that takes in one such array and returns the partialSum array back as illustrated in the example above.

Approach 1: Using map() and reduce() together

The idea here is simple, since we are required to return one particular element for each and every element in the array, we can use the Array.prototype.map() method which does exactly this for us.

And if we make the map() method to return the reduced sum of the required elements by comparing the particular indices, we will get the work done.

So, here is the code for doing this −

const arr = [10, 5, 6, 12, 7, 1];
const partSum = arr.map((item, index) => {
   return arr.reduce((acc, val, ind) => {
      return ind >= index ? acc+val : acc;
   }, 0);
});
console.log(partSum);

Approach 2: Using recursive functions

Here we will make use of two recursive functions,

• First is sumRecursively(arr, start) which returns the sum of the elements of arr from the index start till the very end.

• Second is partSumRecursively() that recursively concatenates the required sum into an array and when we reach the end of the array, it returns the concatenated array.

The code for doing this will be −

Example

const arr = [10, 5, 6, 12, 7, 1];
const sumRecursively = (arr, start = 0, res = 0) => {
   if(start < arr.length){
      return sumRecursively(arr, start+1, res+arr[start]);
   };
   return res;
};
const partSumRecursively = (arr, partSum = [], start = 0, end =
arr.length-1) => {
   if(start <= end){
      return partSumRecursively(arr, partSum.concat(sumRecursively(arr,
      start)), ++start, end);
   };
   return partSum;
};
console.log(partSumRecursively(arr));

Output

The output in the console for both of the methods will be −

[ 41, 31, 26, 20, 8, 1 ]

AmitDiwan

Updated on 20-Aug-2020 06:37:20

• Related Questions & Answers
• Creating an associative array in JavaScript with push()?
• Array thirds with equal sums in JavaScript
• Recursion - Sum Nested Array in JavaScript
• Modified version of summing an array with recursion in JavaScript
• Creating a JavaScript array with new keyword.
• Largest index difference with an increasing value in JavaScript
• Creating an associative array in JavaScript?
• Maximize the sum of array by multiplying prefix of array with -1 in C++
• Subarray pairs with equal sums in JavaScript
• Finding three elements with required sum in an array in JavaScript
• JavaScript - filtering array with an array
• Construct Target Array With Multiple Sums in C++
• Maximum sum increasing subsequence from a prefix and a given element after prefix is must in C++
• Can array be divided into n partitions with equal sums in JavaScript
• Returning number with increasing digits. in JavaScript