From d45ff098e249c1e5b00ac6aef635f6964beca642 Mon Sep 17 00:00:00 2001
From: Oleksandr Bakai <saniabakay@gmail.com>
Date: Thu, 19 Jun 2025 21:12:21 +0200
Subject: [PATCH] js functions

---
 src/functions-and-arrays.js | 63 +++++++++++++++++++++++++++++++------
 1 file changed, 54 insertions(+), 9 deletions(-)

diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js
index ce8695c..aa5eaac 100644
--- a/src/functions-and-arrays.js
+++ b/src/functions-and-arrays.js
@@ -1,21 +1,46 @@
 // Iteration 1 | Find the Maximum
-function maxOfTwoNumbers() {}
-
+function maxOfTwoNumbers(num1,num2) {
+    if (num1>num2){
+        return num1;
+    }
+    else if (num1 === num2){
+        return num1;
+    }
+    else{return num2;}
+}
 
+maxOfTwoNumbers(5,5);
 
 
 // Iteration 2 | Find the Longest Word
 const words = ["mystery", "brother", "aviator", "crocodile", "pearl", "orchard", "crackpot"];
 
-function findLongestWord() {}
-
-
-
+function findLongestWord(words) {
+    if(words.length===0){
+        return null;
+    }
+    let longestWord = words[0];
+    for(let i=1;i<words.length;i++){
+            if (longestWord.length<words[i].length){
+           longestWord = words[i];}
+    }
+    return longestWord;
+}
 
 // Iteration 3 | Sum Numbers
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
-function sumNumbers() {}
+function sumNumbers(numbers) {
+    if(numbers.length===0){
+        return 0;
+    }
+    let container = 0;
+    for(let i =0;i<numbers.length;i++){
+        
+        container+=numbers[i];
+    }
+    return container;
+}
 
 
 
@@ -23,12 +48,32 @@ function sumNumbers() {}
 // Iteration 4 | Numbers Average
 const numbers2 = [2, 6, 9, 10, 7, 4, 1, 9];
 
-function averageNumbers() {}
+function averageNumbers(numbers2) {
+    if(numbers2.length===0){
+        return 0;
+    }
+    let totalSum = sumNumbers(numbers2);
+    return totalSum/numbers2.length;
+ 
+}
 
 
 
 
 // Iteration 5 | Find Elements
 const words2 = ["machine", "subset", "trouble", "starting", "matter", "eating", "truth", "disobedience"];
+ let arrayOfWords;
+let wordToSearch;
+function doesWordExist(arrayOfWords,wordToSearch) {
+   
+    if (arrayOfWords.length===0){/*return null*/
+        return null;
+    }
+    for(let i=0; i<arrayOfWords.length; i++){/*runs array*/
+        if(wordToSearch===arrayOfWords[i]){ /*compare words*/
+            return true;
+        }
+    }
+    return false;
+}
 
-function doesWordExist() {}