Iteracion 1 (sin Bonus)

Author: jmartinez69

starter-code/src/functions-and-arrays.js

@@ -1,5 +1,11 @@
 // Find the maximum
-
+function maxOfTwoNumbers(num1, num2){
+ if (num1 > num2){
+ return num1;
+ } else {
+ return num2;
+ } 
+}
 // Finding Longest Word
 var words = [
  'mystery',
@@ -11,14 +17,49 @@ var words = [
  'crackpot'
 ];
 
+function findLongestWord(arrWords){
+
+
+
+if (arrWords.length > 0){
+ var indexMax = 0;
+ var lengthMax = arrWords[indexMax].length;
+ for (var i = 0; i < arrWords.length; i++){
+ if (arrWords[i].length > lengthMax){
+ lengthMax= arrWords[i].length;
+ indexMax=i;
+ } 
+ } return arrWords[indexMax];
+}else {
+ return undefined;
+ }
+}
+
 // Calculating a Sum
 
 var numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
-
+function sumArray(arrNumbers){
+ var sum = 0;
+ if (arrNumbers.length > 0){
+ for (var i = 0; i < arrNumbers.length; i++){
+ sum = sum + arrNumbers[i];
+ }
+ return sum;
+ } else {
+ return 0;
+ }
+ 
+}
 // Calculate the Average
 
 var numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
+function averageNumbers(arrAverage) {
+ if (arrAverage.length > 0) {
+ return sumArray (arrAverage) / arrAverage.length;
+ }
+} 
+
 // Array of Strings
 var wordsArr = [
  'seat',
@@ -33,6 +74,17 @@ var wordsArr = [
  'palace'
 ];
 
+function averageWordLength (arrStr) {
+ var lengthWord = [];
+ if (arrStr.length > 0) {
+ for (var i = 0; i < arrStr.length; i++) {
+ lengthWord.push(arrStr[i].length);
+ } return averageNumbers(lengthWord);
+ } else {
+ return undefined;
+ }
+}
+
 // Unique Arrays
 var wordsUnique = [
  'crab',
@@ -47,7 +99,19 @@ var wordsUnique = [
  'simple',
  'bring'
 ];
-
+function uniquifyArray(arrWords){
+ var uniqueArray = arrWords;
+ if (arrWords.length > 0){
+ for (var i = 0; i < arrWords.length; i++){
+ for (var j = i+1; j < arrWords.length; j++){
+ if (arrWords[i] == arrWords[j]){
+ arrWords.splice(j,1);
+ j--;
+ }
+ }
+ } return arrWords;
+ }
+}
 // Finding Elements
 var wordsFind = [
  'machine',
@@ -59,6 +123,18 @@ var wordsFind = [
  'truth',
  'disobedience'
 ];
+function doesWordExist(wordsArr, word){
+ if (wordsArr.length>0){
+ for (var i=0; i<wordsArr.length; i++){
+ if (wordsArr[i] == word){
+ return true;
+ }
+ } return false;
+
+ } else { 
+ return false;
+ }
+} 
 
 // Counting Repetion
 var wordsCount = [
@@ -74,6 +150,18 @@ var wordsCount = [
  'disobedience',
  'matter'
 ];
+function howManyTimes(wordsArr, word){
+ var count=0;
+ if (wordsArr.length>0){
+ for (var i=0; i<wordsArr.length; i++){
+ if (wordsArr[i] == word){
+ count++;
+ }
+ } return count;
+ } else { 
+ return false;
+ }
+}
 // Bonus Quest
 
 var matrix = [