Skip to content

Update sample scripts #476

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.

Sign up for GitHub

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

Already on GitHub? Sign in to your account

Merged
chvmvd merged 2 commits into from
Oct 18, 2023
Merged

Update sample scripts #476

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
47302e1
Update sample scripts in loop
chvmvd Oct 18, 2023
72bc9f7
Update sample scripts in array
chvmvd Oct 18, 2023
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
8 changes: 4 additions & 4 deletions docs/1-trial-session/08-loop/_samples/is-prime-using-and/script.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,17 +1,17 @@
const n = 89; //任意の整数
const n = 89; // 任意の整数

let isPrime = true;
if (n <= 1) {
// nが1以下のときは素数でない
isPrime = false;
}

for (let i = 2; i < n; i += 1) {
// nが1以下のときは素数でない
isPrime = isPrime && n % i != 0;
}

if (isPrime) {
document.write(`${n} は素数です。`);
document.write(`${n} は素数です`);
} else {
document.write(`${n} は素数ではありません。`);
document.write(`${n} は素数ではありません`);
}
4 changes: 2 additions & 2 deletions docs/1-trial-session/08-loop/_samples/is-prime/script.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,8 +7,8 @@ if (n <= 1) {
}

for (let i = 2; i < n; i += 1) {
if (n % i == 0) {
isPrime = false; // 変数には最後に代入した値のみを保持する
if (n % i === 0) {
isPrime = false;
}
}

Expand Down
4 changes: 1 addition & 3 deletions docs/1-trial-session/08-loop/_samples/product-alt/script.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,5 @@
let product = 1;

for (let i = 1; i <= 10; i += 1){
for (let i = 1; i <= 10; i += 1) {
product *= i;
}

document.write(product);
4 changes: 1 addition & 3 deletions docs/1-trial-session/08-loop/_samples/product/script.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,5 @@
let product = 1;

for (i = 1; i <= 10; i = i + 1) {
for (let i = 1; i <= 10; i = i + 1) {
product = product * i;
}

document.write(product);
10 changes: 5 additions & 5 deletions docs/1-trial-session/10-array/_samples/array-max/script.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,8 @@
const array1 = [3, 6, 8, 5, 0];
const array2 = [-8, -7, -3, -1, -5];
const array3 = [5986, 7202, 9347, 3593, 8166, 662, 2235, 9323, 2240, 943];
const array4 = [-878, -40, -324, -410, -592, -610, -880, -65, -423, -32];

function findMaxNumber(numbers) {
if (numbers.length === 0) return; // 空配列を除外
let maxNumber = numbers[0];
Expand All @@ -9,11 +14,6 @@ function findMaxNumber(numbers) {
return maxNumber;
}

const array1 = [3, 6, 8, 5, 0];
const array2 = [-8, -7, -3, -1, -5];
const array3 = [5986, 7202, 9347, 3593, 8166, 662, 2235, 9323, 2240, 943];
const array4 = [-878, -40, -324, -410, -592, -610, -880, -65, -423, -32];

document.write(
`<p>配列 [${array1}] の最大値は${findMaxNumber(array1)} です。</p>`,
);
Expand Down