-
Notifications
You must be signed in to change notification settings - Fork 69
Expand file tree
/
Copy patharray-functions.js
More file actions
111 lines (101 loc) · 3.08 KB
/
array-functions.js
File metadata and controls
111 lines (101 loc) · 3.08 KB
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
//in the function map, create a new array and store in a variable
//loop theArray and call the fnc for each thing in the array,
// passing in the item from the current loop into the call to fnc
//add the returned value from fnc to the new array
//return the new array
export function map(theArray, fnc){
var newArray = [];
for(var i=0; i < theArray.length; i++){
var currentItem = thearray[i];
var returnedItem = fnc(currentItem);
newArray[i] = (returnedItem);
}
return newArray;
}
//create a new array
//loop theArray and call the fnc for each thing in the array,
// passing in the item from the current loop
//fnc will return true or false, if true add the item to the new array else do not
//return the new array
export function filter(theArray, fnc){
var newArray = [];
for(var i = 0; i < theArray.length; i++){
var currentItem = theArray[i];
var returnedItem = fnc(currentItem);
if (returnedItem === true) {
newArray.push(returnedItem);
}
return newArray;
}
//loop theArray and call the fnc for each thing in the array,
// passing in the item from the current loop
//fnc will return true or false, if true return the item
//return null
export function find(theArray, fnc){
for(var i = 0; i < theArray.length; i++){
var currentItem = theArray[i];
var returnedItem = fnc(currentItem);
if (returnedItem === true) {
return returnedItem;
}
}
}
//return the last item in theArray
export function findLast(theArray){
var last = theArray[theArray.length-1]
return last;
}
//return the first element of the array
export function head(theArray){
var first = theArray[0]
return first;
}
//create a new array
//loop theArray in reverse order
//add the item from each loop to the new array
//return the new array
export function reverse(theArray){
var newArray = [];
for (var i = theArray.length-1; i >= 0; i--){
var item = theArray[i];
newArray.push(item);
}
return newArray;
}
//create a new array
//loop theArray
//add the item from each loop to the new array except the first item
//return the new array
export function tail(theArray){
var newArray[];
for(var i = 1; i < theArray.length; i++){
var item = theArray[i];
newArray.push(item);
}
return newArray;
}
//implement the most basic sorting algorithm there is
//assume the array will always have numbers
//use a while loop to constantly loop theArray until it is sorted
//use a for loop to loop theArray
//look at the current item and the next item, compare them
//if the items are out of order, swap them
//initialize a variable that indicates if a swap had to be done, set it to false
//if a swap is done set it to true
//after each for loop check the variable, if true, continue the while loop
//if false return theArray
export function sort(theArray){
do {
var swap = false;
for(var i = 0; i < theArray.length; i++) {
var currentItem = theArray[i];
var nextItem = theArray[i+1];
if (currentItem > secondItem) {
theArray[i] = nextItem;
theArray[i+1] = currentItem;
var swap = true;
}
}
while (swap);
}
}