Good morning! Here's our prompt for today.

In JavaScript there is a built-in method called reduce() that can be used over the Array prototype. What this method does, is that it executes a user-supplied "reducer" callback function on each element of the array, in order, passing in the return value from the calculation on the preceding element. The final result of running the reducer across all elements of the array is a single value.

The first time that the callback is run there is no "return value of the previous calculation". If supplied, an initial value may be used in its place. Otherwise the array element at index 0 is used as the initial value and iteration starts from the next element (index 1 instead of index 0).

The easiest to understand case for reduce() is to return the sum of all the elements in an array:

1const array1 = [1, 2, 3, 4];
2
3// 0 + 1 + 2 + 3 + 4
4const initialValue = 0;
5const sumWithInitial = array1.reduce(
6  (previousValue, currentValue) => previousValue + currentValue,
7  initialValue
8);
9
10console.log(sumWithInitial);
11// expected output: 10

Can you implement your own version of this method?

Try to solve this here or in Interactive Mode.

How do I practice this challenge?

xxxxxxxxxx

Array.prototype.myReduce = function (callback, initialValue) {

  const argsLength = arguments.length;

  //If array is empty and there is no initial value, return an error

  if (argsLength === 1 && this.length === 0) {

    throw new Error();

  }

​

  let index = argsLength === 1 ? 1 : 0;

  let resultValue = argsLength === 1 ? this[0] : initialValue;

​

  //Call the callback function for every element and replace the resultValue

  for (let i = index; i < this.length; i += 1) {

    resultValue = callback(resultValue, this[i], i, this);

  }

​

  return resultValue;

};

​

Here's how we would solve this problem...

How do I use this guide?

Solution

Our solution would be a function that recceives 2 arguments: the callback function, and an initial value (optional).

First, we are going to check if we have passed an empty array without an initial value, and if so, return an error:

1const argsLength = arguments.length;
2
3if (argsLength === 1 && this.length === 0) {
4  throw new Error();
5}

Then we are going to define our initial index, and initial result value - based on our argsLength. So, our initial result value will be the initialValue if any supplied, or otherwise it will be the return value of the previous calculation.

1let  index  =  argsLength  ===  1  ?  1  :  0;
2let  resultValue  =  argsLength  ===  1  ?  this[0] :  initialValue;

Then, in a for loop, we are going to call the callback function with the adequate parameters (current result value, the currently looped array element, its index, and the array itself). The return value of the callback function will be our new result value.

1for (let i = index; i < this.length; i += 1) {
2  resultValue = callback(resultValue, this[i], i, this);
3}

This being said, our final solution would look like this:

1Array.prototype.myReduce = function (callback, initialValue) {
2  const argsLength = arguments.length;
3  //If array is empty and there is no initial value, return an error
4  if (argsLength === 1 && this.length === 0) {
5    throw new Error();
6  }
7
8  let index = argsLength === 1 ? 1 : 0;
9  let resultValue = argsLength === 1 ? this[0] : initialValue;
10
11  //Call the callback function for every element and replace the resultValue
12  for (let i = index; i < this.length; i += 1) {
13    resultValue = callback(resultValue, this[i], i, this);
14  }
15
16  return resultValue;
17};