Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

VITFED16#94

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.

Already on GitHub?Sign in to your account

Open
nirati16 wants to merge1 commit intoprograd-org:master
base:master
Choose a base branch
Loading
fromnirati16:master
Open
Show file tree
Hide file tree
Changes fromall commits
Commits
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
97 changes: 97 additions & 0 deletionsindex.html
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,97 @@
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Arrays & Functions</title>
<script src="./src/functions-and-arrays.js"></script>
</head>
<body>

<!-- Greatest of the two -->
<h2>Greatest of the two</h2>
<input type="number" id="n1" placeholder="1st number">
<input type="number" id="n2" placeholder="2nd number">
<input type="submit" value="Submit" onclick="greatestOfTwoNumbers()">
<span> &nbsp;&nbsp; Maximum: <span id="max"></span></span>
<!-- -->

<br><br><br><br>

<!-- The lengthy word -->
<h2>The lengthy word</h2>
<p style="font-size: larger;">Words are = 'George', 'Alice', 'Alex', 'John', 'Infanta', 'Xavior', 'LourdhAntony'</p>
<input type="submit" value="Submit" onclick="findScaryWord()">
<span> &nbsp;&nbsp; Lengthy Word: <span id="lengthy"></span></span>
<!-- -->

<br><br><br><br>

<!-- Net Price -->
<h2>Net Price</h2>
<p style="font-size: larger;">Prices = 200, 120, 100, 108, 135, 162, 25, 170, 80, 110</p>
<input type="submit" value="Submit" onclick="netPrice()">
<span> &nbsp;&nbsp; Net Price: <span id="net"></span></span>
<!-- -->

<br><br><br><br>

<!-- Mid Point -->
<h2>Mid Point</h2>
<h3>Array of Numbers (4.1)</h3>
<p style="font-size: larger;">Levels = 22, 16, 9, 10, 7, 14, 11, 9</p>
<input type="submit" value="Submit" onclick="midPointOfLevels()">
<span> &nbsp;&nbsp; Average: <span id="avg"></span></span>

<br><br>

<h3>Array of Strings (4.2)</h3>
<p style="font-size: larger;">Items = 'bread', 'jam', 'milk', 'egg', 'flour', 'oil', 'rice', 'coffee powder', 'sugar', 'salt'</p>
<input type="submit" value="Submit" onclick="averageWordLength()">
<span> &nbsp;&nbsp; Average WordLength: <span id="avg-str"></span></span>
<!-- -->

<br><br><br><br>

<!-- Unique arrays -->
<h3>Unique arrays</h3>
<p style="font-size: larger;">Items = 'bread', 'jam', 'milk', 'egg', 'flour', 'oil', 'rice', 'coffee powder', 'sugar', 'salt', 'egg', 'flour'</p>
<input type="submit" value="Submit" onclick="uniqueArray()">
<span> &nbsp;&nbsp; Unique Array: <span id="unique"></span></span>
<!-- -->

<br><br><br><br>

<!-- Find elements -->
<h3>Find elements</h3>
<p style="font-size: larger;">Words = 'door', 'window', 'ceiling', 'roof', 'plinth', 'tiles', 'ceiling', 'flooring'</p>
<input type="text" id="str" placeholder="search element">
<input type="submit" value="Submit" onclick="searchElement()">
<span> &nbsp;&nbsp; Element present: <span id="found"></span></span>
<!-- -->

<br><br><br><br>

<!-- Count repeated elements -->
<h3>Count repeated elements</h3>
<p style="font-size: larger;">Words = 'machine', 'matter', 'subset', 'trouble', 'starting', 'matter', 'eating', 'matter', 'truth', 'disobedience', 'matter'</p>
<input type="submit" value="Submit" onclick="howManyTimesElementRepeated()">
<p> &nbsp;&nbsp;Frequencies: <span id="freq"></span></p>
<!-- -->

<br><br><br>

<!-- Product of adjacent numbers -->
<h3>Product of adjacent numbers</h3>
<p style="font-size: larger;">Matrix = (5x5)<br>
[ 1, 2, 3, 4, 5] <br>
[ 1, 25, 3, 4, 5] <br>
[ 1, 20, 3, 4, 5] <br>
[ 1, 20, 3, 4, 5] <br>
[ 1, 4, 3, 4, 5] <br></p>
<input type="submit" value="Submit" onclick="maximumProduct()">
<p> &nbsp;&nbsp;Max product: <span id="maxP"></span></p>

</body>
</html>
201 changes: 138 additions & 63 deletionssrc/functions-and-arrays.js
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -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<words.length; i++){
if(words[i].length > 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<prices.length; i++)
sum += prices[i];
document.getElementById("net").innerText = sum;
}

// Mid Point
//4.1
function midPointOfLevels(){
const levels = [22, 16, 9, 10, 7, 14, 11, 9];
let sum = 0;
for(let i=0; i<levels.length; i++){
sum += levels[i];
}
let average = sum / levels.length;
document.getElementById("avg").innerText = average;
}
//4.2
function averageWordLength(){
const items = ['bread', 'jam', 'milk', 'egg', 'flour', 'oil', 'rice', 'coffee powder', 'sugar', 'salt'];
let sum = 0;
for(let i=0; i<items.length; i++){
let len = items[i].length;
sum += len;
}
let avg_str = sum / items.length;
document.getElementById("avg-str").innerText = avg_str;
}

// Unique arrays
function uniqueArray(){
const items = ['bread', 'jam', 'milk', 'egg', 'flour', 'oil', 'rice', 'coffee powder', 'sugar', 'salt', 'egg', 'flour'];
let unique_arr = [...new Set(items)];
document.getElementById("unique").innerText = unique_arr;
}

// Find elements
function searchElement(){
const words = ['door','window','ceiling','roof','plinth','tiles','ceiling','flooring'];
let str = document.getElementById("str").value;
for(let i=0; i<words.length; i++){
if(str == words[i]){
document.getElementById("found").innerText = "True";
break;
}
else
document.getElementById("found").innerText = "False";
}
}

// Count repeated elements
function howManyTimesElementRepeated(){
const words = ['machine', 'matter', 'subset', 'trouble', 'starting', 'matter', 'eating', 'matter', 'truth', 'disobedience', 'matter'];
var answer = [];
for(let i=0; i<words.length; i++){
let f = 0;
let current = words[i];

for(let j=0; j<words.length; j++)
if(current == words[j])
f++;
answer.push(" " + words[i] + " - " + f + " ");
document.getElementById("freq").innerText = answer;
}
}

// Product of adjacent numbers
function maximumProduct(){
function findMaxP(arr, n){
let max = 0, result;
for(let i=0; i<n; i++){
for(let j=0; j<n; j++){

if((j-3) >= 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);
}
[8]ページ先頭
©2009-2026 Movatter.jp