diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index ce8695c..81526b1 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -1,34 +1,105 @@ // Iteration 1 | Find the Maximum -function maxOfTwoNumbers() {} +let biggestNumber = 0 + +function maxOfTwoNumbers(firstNumber, secondNumber) { + + if (firstNumber < secondNumber) { + biggestNumber = secondNumber + return biggestNumber + } + + else if (firstNumber > secondNumber){ + biggestNumber = firstNumber + return biggestNumber + } +} + +maxOfTwoNumbers(89,56) // test + +console.log(maxOfTwoNumbers(89,56)) // test // Iteration 2 | Find the Longest Word -const words = ["mystery", "brother", "aviator", "crocodile", "pearl", "orchard", "crackpot"]; +const words = ["mystery", "brother", "antiotebureuiabguiero", "crocodile", "pearl", "orchard", "crackpot"]; -function findLongestWord() {} +let newArr=[" "] +function findLongestWord() { + for (i=0 ; i newArr[0].length) { + newArr.pop() + newArr.push(words[i]) + } + + } + return newArr +} +result = findLongestWord(["mystery", "brother", "aviator", "crocodile", "pearl", "orchard", "crackpot"]) +console.log(result) // Iteration 3 | Sum Numbers const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; -function sumNumbers() {} +function sumNumbers() { +let sum = 0 + for(i=0 ; i