javascript-execution-flow/MapFilterReduce.js at main · swathireddy369/javascript-execution-flow · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
let arr = [5, 1, 3, 6, 2];

// function double(i){
//      return i*2;
// }
// function triple(i){
//      return i*3;
// }
// function binary(i){
//      return i.toString(2);//to convert number into binary
// }
// let output=arr.map(double);
console.log(arr.map(function double(i) { ///1way
     return i * 2;
}));
console.log(arr.map(function (i) {
     return i * 3;
}));
console.log(arr.map((i) => i.toString(2)));//finak efficinet way of writting map


console.log("=============================filter===========================");
function isOdd(i) {
     return i % 2;
}
function isEven(i) {
     return i % 2;
}
let output = arr.filter(isOdd);
console.log(arr.filter(function isOdd(i) {
     return i % 2;//odd
}));
console.log(arr.filter((i) => {
     return i % 2 == 0;//even
}));
console.log(arr.filter((i) => i % 2 !== 0));//not even

console.log("========================reduce===========================");
function sum(acc, curr) {
     acc += curr;
     return acc;
}

console.log(arr.reduce(sum, 0));
console.log(arr.reduce(function sum(acc, curr) {
     acc += curr;
     return acc;
}, 0));
console.log(arr.reduce(function max(acc, curr) {
     if (acc < curr) {
          acc = curr;
     }
     return acc;

}, 0));
console.log(arr.reduce((acc, curr)=> {
     if (acc < curr) {
          acc = curr;
     }
     return acc;

}, 0));