-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathprograms in anonymous function & IIFE & Arrow function.docx
251 lines (199 loc) · 6.76 KB
/
programs in anonymous function & IIFE & Arrow function.docx
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
a. Print odd numbers in an array
Anonymous function:
var array=[1,2,3,4,5]
function odds(){
for(var i = 0 ; i< array.length ; i++){
if(array[i]%2!=0){
console.log(array[i])
}
}
}
odds();
IIFE:
(function(array){
for(var i = 0 ; i< array.length ; i++){
if(array[i]%2!=0){
console.log(array[i])
}
}
})([1,2,3,4])
Arrow function:
let array=[1,2,3,4,5]
array.forEach((i)=>{
if(array[i]%2 != 0){
console.log(array[i])
}
})
b. Convert all the strings to title caps in a string array
Anonymous function:
function titleCase(str){
var words = str.toLowerCase().split(" ").map(function(i){
return i[0].toUpperCase()+i.slice(1)
})
return words.join(" ")
}
titleCase('my name is raja');
IIFE:
(function (str) {
str = str.toLowerCase().split(' ');
for (var i = 0; i < str.length; i++) {
str[i] = str[i].charAt(0).toUpperCase() + str[i].slice(1);
}
return str.join(' ');
})("my name is raja");
Arrow Function :
titleCase = (str) => {
str = str.toLowerCase().split(' ');
for (var i = 0; i < str.length; i++) {
str[i] = str[i].charAt(0).toUpperCase() + str[i].slice(1);
}
return str.join(' ');
}
c. Sum of all numbers in an array
anonymous :
function(array){
var sum = 0;
for(var i = 0 ; i< array.length ; i++){
sum = sum + array[i];
}
return sum;
}
IIFE :
(function(array){
var sum = 0;
for(var i = 0 ; i< array.length ; i++){
sum = sum + array[i];
}
return sum;
})([1,2,3,4])
Arrow:
sum = (array)=>{
var sum = 0;
for(var i = 0 ; i< array.length ; i++){
sum = sum + array[i];
}
return sum;
}
d. Return all the prime numbers in an array
Anonymous Function:
function(numArray){
numArray = numArray.filter((number) => {
for (var i = 2; i <= Math.sqrt(number); i++) {
if (number % i === 0) return false;
}
return true;
});
console.log(numArray);
}
IIFE
(function(numArray){
numArray = numArray.filter((number) => {
for (var i = 2; i <= Math.sqrt(number); i++) {
if (number % i === 0) return false;
}
return true;
});
console.log(numArray);
})([1,2,3,4])
Arrow Function :
primeNumber = (numArray) => {
numArray = numArray.filter((number) => {
for (var i = 2; i <= Math.sqrt(number); i++) {
if (number % i === 0) return false;
}
return true;
});
console.log(numArray);
}
e. Return all the palindromes in an array
function isPalindrome(N)
{
let str = "" + N;
let len = str.length;
for (let i = 0; i < parseInt(len / 2, 10); i++)
{
if (str[i] != str[len - 1 - i ])
return false;
}
return true;
}
Anonymous Function : function (arr, n)
{
// Traversing each element of the array
// and check if it is palindrome or not
for (let i = 0; i < n; i++)
{
let ans = isPalindrome(arr[i]);
if (ans == false)
return false;
}
return true;
}
IIFE :
( function (arr, n)
{
// Traversing each element of the array
// and check if it is palindrome or not
for (let i = 0; i < n; i++)
{
let ans = isPalindrome(arr[i]);
if (ans == false)
return false;
}
return true;
})([1,2,3] , 3)
Arrow :
Palindrome = (arr, n) =>
{
// Traversing each element of the array
// and check if it is palindrome or not
for (let i = 0; i < n; i++)
{
let ans = isPalindrome(arr[i]);
if (ans == false)
return false;
}
return true;
}
f. Return median of two sorted arrays of same size
g. Remove duplicates from an Array
Anonymous Function :
function(array){
let dup = [...new Set(array)];
console.log(dup);
}
IIFE :
(function(array){
let dup = [...new Set(array)];
console.log(dup);
})([1,1,2,3,4])
h. Rotate an array by K times
function reverse(array , li , ri){
while(li < ri){
int temp = a[li];
a[li]= a[ri];
a[ri] = temp;
li++;
ri--;
}
}
Anonymous function :
function(array , k){
k = k % a.length;
if(k < 0){
k += a.length;
}
reverse(a, 0, a.length - k - 1);
reverse(a, a.length - k, a.length - 1);
reverse(a, 0, a.length - 1);
}
IIFE :
(function(array , k){
k = k % a.length;
if(k < 0){
k += a.length;
}
reverse(a, 0, a.length - k - 1);
reverse(a, a.length - k, a.length - 1);
reverse(a, 0, a.length - 1);
})([1,2,3,4] , 2)