VITFED50

src/functions-and-arrays.js

@@ -1,17 +1,127 @@
 // Progression #1: Greatest of the two numbers
 
+function greatestOfTwoNumbers(num1,num2)
+{
+ if(num1>num2)
+ {
+   return num1;
+ }
+ else if(num2>num1)
+ {
+   return num2;
+ }
+ else{
+   return num1;
+ }
+}
+
+
+
+
 // Progression #2: The lengthy word
 const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot'];
 
+function findScaryWord(words){
+  if(words.length==0){
+    return null;
+  }  
+  else if(words.length==1){
+    return words[0];
+  }
+  else if(words.length==2){
+    if(words[0].length==words[1].length){
+      return words[0];
+    }
+  }
+  else if(words.length>2){
+    for(i=0;i<words.length;i++){      
+      if(words[0].length<words[i].length){
+        words[0] = words[i];
+      }   
+    }
+    return words[0];
+  }
+}
+
+
+
+
+
+
 // Progression #3: Net Price
 const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10];
+function netPrice(numbers)
+{
+  var sum=0;
+  for(i=0;i<numbers.length;i++)
+  {
+    sum=sum+numbers[i];
+  }
+  return sum;
+}
+
 
 // Progression #4: Calculate the average
 // Progression 4.1: Array of numbers
 const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9];
 
+function midPointOfLevels(numbersAvg)
+{
+   var sum=0,avg;
+  if(numbersAvg.length==0)
+  {
+    return null;
+  }
+  else
+  {
+    for(var i=0;i<numbersAvg.length;i++)
+    {
+      sum=sum+numbersAvg[i];
+    }
+    avg=sum/numbersAvg.length;
+    return avg;
+  }
+}
+
+
 // Progression 4.2: Array of strings
 const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace'];
+function averageWordLength(wordsArr)
+{
+  var sum=0;
+  if(wordsArr.length==0)
+  {
+    return null;
+  }
+  else{
+    for(var i=0;i<wordsArr.length;i++)
+    {
+      sum=sum+wordsArr[i].length;
+    }
+    return sum/wordsArr.length;
+  }
+}
+
+
+// Progression 4.3 (Bonus): A generic avg() function
+const mixedArr = [63, 122, 'audi', 61, true, 'volvo', '20', 'lamborghini', 38, 156];
+function avg(mixedArr)
+{ sum=0; average=0;
+  if(mixedArr.length==0)
+    return null;
+
+   for(i=0;i<mixedArr.length;i++)
+   {  if(typeof(mixedArr[i])==='number')
+     sum = sum + mixedArr[i];
+     else if(typeof(mixedArr[i])==='string')
+     sum = sum + mixedArr[i].length;
+   }
+   average = (sum/mixedArr.length).toFixed(2);
+   return average;
+}
+
+
+
 
 // Progression #5: Unique arrays
 const wordsUnique = [
@@ -29,8 +139,48 @@ const wordsUnique = [
   'flour'
 ];
 
+function uniqueArray(wordsUnique)
+{
+  if(wordsUnique.length==0)
+  {
+    return null;
+  }
+  else{
+    for(var i=0;i<wordsUnique.length;i++)
+    {
+      for(var j=i+1;j<wordsUnique.length;j++)
+      {
+        if(wordsUnique[i]==wordsUnique[j])
+        {
+          wordsUnique.splice(j,j);
+        }
+      }
+    }
+    return wordsUnique;
+  }
+
+}
+
+
 // Progression #6: Find elements
 const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience'];
+function searchElement(wordsFind,word)
+{
+  if(wordsFind.length==0)
+  {
+    return null;
+  }
+  else{
+    for(var i=0;i<wordsFind.length;i++)
+    {
+      if(wordsFind[i]==word)
+      {
+        return true;
+      }
+    }
+  }
+}
+
 
 // Progression #7: Count repetition
 const wordsCount = [
@@ -47,6 +197,25 @@ const wordsCount = [
   'matter'
 ];
 
+function howManyTimesElementRepeated(wordsCount,word)
+{
+  var c=0;
+  if(wordsCount.length==0)
+  {
+    return c;
+  }
+  else{
+    for(var i=0;i<wordsCount.length;i++)
+    {
+      if(wordsCount[i]==word)
+      {
+        c=c+1;
+      }
+    }
+    return c;
+  }
+}
+
 // Progression #8: Bonus
 
 const matrix = [