forked from loiane/javascript-datastructures-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path13-IntroFunctionalProgramming.js
147 lines (114 loc) · 3.18 KB
/
13-IntroFunctionalProgramming.js
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
console.log('Using imperative JS');
var printArray = function(array){
for (var i=0; i<array.length; i++){
console.log(array[i]);
}
};
printArray([1, 2, 3, 4, 5]);
//how can we abstract the For flow? Can we use a callback for action?
console.log('Using functional JS');
var forEach = function(array, action){
for (var i=0; i<array.length; i++){
action(array[i]);
}
};
var logItem = function (item) {
console.log(item);
};
forEach([1, 2, 3, 4, 5], logItem);
//how can we abstract the For flow?
console.log('Finding the min value in an array - imperative');
var findMinArray = function(array){
var minValue = array[0];
for (var i=1; i<array.length; i++){
if (minValue > array[i]){
minValue = array[i];
}
}
return minValue;
};
console.log(findMinArray([8,6,4,5,9]));
console.log('Finding the min value in an array - functional ES2015');
const min_ = function(array){
return Math.min(...array)
};
//simplifying using arrow functions
const min = arr => Math.min(...arr);
console.log(min_([8,6,4,5,9]));
console.log(min([8,6,4,5,9]));
//concat + reduce
console.log('merge arrays - imperative');
var mergeArrays_ = function(arrays){
var count = arrays.length,
newArray = [],
k =0;
for (var i=0; i<count; i++){
for (var j=0; j<arrays[i].length; j++){
newArray[k++] = arrays[i][j];
}
}
return newArray;
};
console.log(mergeArrays_([[1, 2, 3], [4, 5], [6]]));
console.log('merge arrays - using concat');
var mergeArraysConcat = function(arrays){
return arrays.reduce( function(p,n){
return p.concat(n);
});
};
console.log(mergeArraysConcat([[1, 2, 3], [4, 5], [6]]));
console.log('merge arrays - ES2015');
const mergeArrays = (...arrays) => [].concat(...arrays);
console.log(mergeArrays([1, 2, 3], [4, 5], [6]));
console.log('sum values of arrays - imperative');
var sumValues = function(array){
var total = array[0];
for (var i=1; i<array.length; i++){
total += array[i];
}
return total;
};
console.log(sumValues([1, 2, 3, 4, 5]));
//reduce
console.log('sum values of arrays - functional');
var sum_ = function(array){
return array.reduce(function(a, b){
return a + b;
})
};
console.log(sum_([1, 2, 3, 4, 5]));
console.log('sum values of arrays - ES2015');
const sum = arr => arr.reduce((a, b) => a + b);
console.log(sum([1, 2, 3, 4, 5]));
//map
var daysOfWeek = [
{name: 'Monday', value: 1},
{name: 'Tuesday', value: 2},
{name: 'Wednesday', value: 7}
];
var daysOfWeekValues_ = [];
for (var i = 0; i < daysOfWeek.length; i++) {
daysOfWeekValues_.push(daysOfWeek[i].value);
}
//to
var daysOfWeekValues = daysOfWeek.map(function(day) {
return day.value;
});
console.log(daysOfWeekValues);
//filter
var positiveNumbers_ = function(array){
var positive = [];
for (var i = 0; i < array.length; i++) {
if (array[i] >= 0){
positive.push(array[i]);
}
}
return positive;
}
console.log(positiveNumbers_([-1,1,2,-2]));
var positiveNumbers = function(array){
return array.filter(function(num){
return num >= 0;
})
};
console.log(positiveNumbers([-1,1,2,-2]));