From dbd3ca1fea940a1e3f65aa7db64dfc79ebcb444e Mon Sep 17 00:00:00 2001
From: Laure-Anais15 <laure_anais@msn.com>
Date: Sun, 2 Mar 2025 18:45:12 +0100
Subject: [PATCH] Solved lab

---
 src/functions-and-arrays.js | 39 ++++++++++++++++++++++++++++++++++---
 1 file changed, 36 insertions(+), 3 deletions(-)

diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js
index 3a7dbec41..0d753e841 100644
--- a/src/functions-and-arrays.js
+++ b/src/functions-and-arrays.js
@@ -1,19 +1,52 @@
 // Iteration #1: Find the maximum
-function maxOfTwoNumbers() {}
+function maxOfTwoNumbers(a, b) {
+  if ((a > b) || (a === b)) {
+    return a;
+  } else {
+    return b;
+  }
+  }
 
 
 
 // Iteration #2: Find longest word
 const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
 
-function findLongestWord() {}
+function findLongestWord(words) {
+
+  if (!words.length){
+    return null;
+  } else if (words.length === 1){
+    return words[0];
+  } else {
+    let longestWord = words[0];
+    for (let i = 1; i < words.length; i++){
+      if (words[i].length > longestWord.length){
+        longestWord = words[i];
+      }
+    }
+    return (longestWord);
+  }
+}
 
 
 
 // Iteration #3: Calculate the sum
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
 
-function sumNumbers() {}
+function sumNumbers(numbers) {
+  if (!numbers.length){
+    return 0;}
+  else if (numbers.length === 1){
+    return numbers[0];
+  } else {
+    let sum = 0;
+    for (let i = 0; i < numbers.length; i++){
+      sum += numbers[i];
+    }
+    return (sum);
+  }
+}