diff --git a/SpecRunner.html b/SpecRunner.html index 73c156f..833cfc9 100644 --- a/SpecRunner.html +++ b/SpecRunner.html @@ -18,5 +18,7 @@ - + + + diff --git a/index.html b/index.html new file mode 100644 index 0000000..25858c8 --- /dev/null +++ b/index.html @@ -0,0 +1,97 @@ + + + + + + + Arrays & Functions + + + + + +

Greatest of the two

+ + + +    Maximum: + + +



+ + +

The lengthy word

+

Words are = 'George', 'Alice', 'Alex', 'John', 'Infanta', 'Xavior', 'LourdhAntony'

+ +    Lengthy Word: + + +



+ + +

Net Price

+

Prices = 200, 120, 100, 108, 135, 162, 25, 170, 80, 110

+ +    Net Price: + + +



+ + +

Mid Point

+

Array of Numbers (4.1)

+

Levels = 22, 16, 9, 10, 7, 14, 11, 9

+ +    Average: + +

+ +

Array of Strings (4.2)

+

Items = 'bread', 'jam', 'milk', 'egg', 'flour', 'oil', 'rice', 'coffee powder', 'sugar', 'salt'

+ +    Average WordLength: + + +



+ + +

Unique arrays

+

Items = 'bread', 'jam', 'milk', 'egg', 'flour', 'oil', 'rice', 'coffee powder', 'sugar', 'salt', 'egg', 'flour'

+ +    Unique Array: + + +



+ + +

Find elements

+

Words = 'door', 'window', 'ceiling', 'roof', 'plinth', 'tiles', 'ceiling', 'flooring'

+ + +    Element present: + + +



+ + +

Count repeated elements

+

Words = 'machine', 'matter', 'subset', 'trouble', 'starting', 'matter', 'eating', 'matter', 'truth', 'disobedience', 'matter'

+ +

  Frequencies:

+ + +


+ + +

Product of adjacent numbers

+

Matrix = (5x5)
+ [ 1, 2, 3, 4, 5]
+ [ 1, 25, 3, 4, 5]
+ [ 1, 20, 3, 4, 5]
+ [ 1, 20, 3, 4, 5]
+ [ 1, 4, 3, 4, 5]

+ +

  Max product:

+ + + \ No newline at end of file diff --git a/src/functions-and-arrays.js b/src/functions-and-arrays.js index 18c9498..249abc1 100644 --- a/src/functions-and-arrays.js +++ b/src/functions-and-arrays.js @@ -1,63 +1,138 @@ -// Progression #1: Greatest of the two numbers - -// Progression #2: The lengthy word -const words = ['mystery', 'brother', 'aviator', 'crocodile', 'pearl', 'orchard', 'crackpot']; - -// Progression #3: Net Price -const numbers = [6, 12, 1, 18, 13, 16, 2, 1, 8, 10]; - -// Progression #4: Calculate the average -// Progression 4.1: Array of numbers -const numbersAvg = [2, 6, 9, 10, 7, 4, 1, 9]; - -// Progression 4.2: Array of strings -const wordsArr = ['seat', 'correspond', 'linen', 'motif', 'hole', 'smell', 'smart', 'chaos', 'fuel', 'palace']; - -// Progression #5: Unique arrays -const wordsUnique = [ - 'bread', - 'jam', - 'milk', - 'egg', - 'flour', - 'oil', - 'rice', - 'coffee powder', - 'sugar', - 'salt', - 'egg', - 'flour' -]; - -// Progression #6: Find elements -const wordsFind = ['machine', 'subset', 'trouble', 'starting', 'matter', 'eating', 'truth', 'disobedience']; - -// Progression #7: Count repetition -const wordsCount = [ - 'machine', - 'matter', - 'subset', - 'trouble', - 'starting', - 'matter', - 'eating', - 'matter', - 'truth', - 'disobedience', - 'matter' -]; - -// Progression #8: Bonus - -const matrix = [ - [08, 02, 22, 97, 38, 15, 00, 40, 00, 75], - [49, 49, 99, 40, 17, 81, 18, 57, 60, 87], - [81, 49, 31, 73, 55, 79, 14, 29, 93, 71], - [52, 70, 95, 23, 04, 60, 11, 42, 69, 24], - [22, 31, 16, 71, 51, 67, 63, 89, 41, 92], - [24, 47, 32, 60, 99, 03, 45, 02, 44, 75], - [32, 98, 81, 28, 64, 23, 67, 10, 26, 38], - [67, 26, 20, 68, 02, 62, 12, 20, 95, 63], - [24, 55, 58, 05, 66, 73, 99, 26, 97, 17], - [21, 36, 23, 09, 75, 00, 76, 44, 20, 45] -]; +// greatestOfTwoNumbers +function greatestOfTwoNumbers(){ + var num1 = parseInt(document.getElementById("n1").value); + var num2 = parseInt(document.getElementById("n2").value); + if(num1 > num2) + document.getElementById("max").innerText = num1; + else + document.getElementById("max").innerText = num2; +} + +// The lengthy word +function findScaryWord(){ + const words = ['George', 'Alice', 'Alex', 'John', 'Infanta', 'Xavior', 'LourdhAntony']; + let longest = ""; + for(let i=0; i longest.length) + longest = words[i]; + } + document.getElementById("lengthy").innerText = longest; +} + +// Net Price +function netPrice(){ + const prices = [200, 120, 100, 108, 135, 162, 25, 170, 80, 110]; + let sum = 0; + for(let i=0; i= 0){ + result = arr[i][j] * arr[i][j-1] + * arr[i][j-2] * arr[i][j-3]; + if(max < result) + max = result; + } + + if((i-3) >= 0){ + result = arr[i][j] * arr[i-1][j] + * arr[i-2][j] * arr[i-3][j]; + if(max < result) + max = result; + } + + if((i-3) >= 0 && (j-3) >= 0){ + result = arr[i][j] * arr[i-1][j-1] + * arr[i-2][j-2] * arr[i-3][j-3]; + if(max < result) + max = result; + } + + if((i-3) >= 0 && (j-1) <= 0){ + result = arr[i][j] * arr[i-1][j+1] + * arr[i-2][j+2] * arr[i-3][j+3]; + if(max < result) + max = result; + } + } + } + return max; + } + + let n = 5; + let arr = [[ 1, 2, 3, 4, 5], + [ 1, 25, 3, 4, 5], + [ 1, 20, 3, 4, 5], + [ 1, 20, 3, 4, 5], + [ 1, 4, 3, 4, 5]]; + + document.getElementById("maxP").innerText = findMaxP(arr, n); +} \ No newline at end of file