Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Shyam & Ute WD PT August 2020 submit lab assignments #1-5 #1870

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.

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

Closed
wants to merge 1 commit into from
Closed
Changes from all commits
Commits
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
54 changes: 54 additions & 0 deletions 54 src/functions-and-arrays.js
Original file line number Diff line number Diff line change
@@ -1,18 +1,63 @@
// Iteration #1: Find the maximum

function maxOfTwoNumbers(number1, number2) {
if (number1 > number2) {
return number1
}
else if (number2 > number1) {
return number2
}
}

// Iteration #2: Find longest word
const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
function findLongestWord(someArray) {
if(someArray.length === 0 ){
return null
}
let longestWord = ""
for (i = 0; i < someArray.length; i++) {
if (someArray[i].length > longestWord.length) {
longestWord = someArray[i]
}
}
return longestWord
}


// Iteration #3: Calculate the sum

const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
function sumNumbers(someNumberArray) {
let sum = 0
for (i = 0; i < someNumberArray.length; i++) {
sum = sum + someNumberArray[i]
}
return sum
}

// Iteration #4: Calculate the average
// Level 1: Array of numbers
const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
function averageNumbers(someNumberArray) {
if(someNumberArray.length === 0 ){
return null
}
return average = sumNumbers(someNumberArray)/someNumberArray.length
}

// Level 2: Array of strings
const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
function averageWordLength(someWordsArr) {
if(someWordsArr.length === 0) {
return null
}
let lengthOfWords = 0
for (i = 0; i < someWordsArr.length; i++) {
lengthOfWords = lengthOfWords + someWordsArr[i].length
}
return average = lengthOfWords/someWordsArr.length
}

// Iteration #5: Unique arrays
const wordsUnique = [
Expand All @@ -29,6 +74,15 @@ const wordsUnique = [
'bring'
];

function uniquifyArray(someArray) {
let uniqueArray = [ ];
for (i = 0; i < someArray.length; i++) {
if (uniqueArray.indexOf(someArray[i]) === -1) {
uniqueArray.push(someArray[i]) }
}
return uniqueArray
}

// Iteration #6: Find elements
const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];

Expand Down
Morty Proxy This is a proxified and sanitized view of the page, visit original site.