Skip to content

completed lab #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
vpkonkiel wants to merge 1 commit into
base: main
Choose a base branch
from
Open

completed lab #3

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
85 changes: 76 additions & 9 deletions ArrayUtils.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,21 +1,88 @@
class ArrayUtils{

isEmpty(array){return false;}
//Problem 1
function isEmpty(array){
if (array.length < 1){
return true
} else {
return false;
}
}

append(original, value){return original;}
//Problem 2
function append(original, value){
original.push(value);
return original;
}

clone(original){return original;}
//Problem 3

let copyArr = [];
function clone(array){
for (let value of array) {
copyArr.push(value)
}
return copyArr;
}

subArray(original, from, to){return original;}
//Problem 4
let newArr = [];
function subArray(array, from, to){
for(let i = array[from]; i <= array[to]; i++) {
newArr = array.push(i);
return newArr;
}
}

equals(arr1, arr2){return false;}
//Problem 5
function equals(arr1, arr2){
if(!arr1 || !arr2) {
return false;
}
if(arr1.length !== arr2.length){
return false;
}
for(let i = 0; i < arr1.length; i++) {
if (arr1[i] == arr2[i]) {
continue;
} else {
return false;
}
}
return true;
}

fill(original, value){}
//Problem 6
function fill(original, value){
for( i = 0; i < original.length; i++) {
original[i] = value;
}
return original;
}

indexOf(original, value){return -1;}
//Problem 7
function indexOf(original, value){
for(i = 0; i < original.length; i++){
if (original[i] == value){
return i;
}
}
return -1;
}

remove(original, value){return original;}
//Problem 8
let newArr = [];
function remove(original, value){
newArr = clone(original);
let index = indexOf(original, value);
newArr.splice(index, 1);
return newArr;
}

reverse(original){}
//Problem 9
function reverse(original){
original.reverse();
return original;
}

}