Skip to content

[PAR-WDFT] Alix #655

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

Closed
wants to merge 1 commit into from
Closed

[PAR-WDFT] Alix #655

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
105 changes: 102 additions & 3 deletions js/index.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,106 @@
// Iteration 1: Names and Input
// ITERATION 1

var hacker1 = "Alix";
console.log(`The driver's name is ${hacker1}.`);
var hacker2 = "PaulC";
console.log(`The navigator's name is ${hacker2}.`);

// Iteration 2: Conditionals
// ITERATION 2

if (hacker1.length > hacker2.length) {
console.log(`The driver has the longest name, it has ${hacker1.length} characters.`);
} else if (hacker1.length < hacker2.length) {
console.log(`It seems that the navigator has the longest name, it has ${hacker2.length} characters.`);
} else {
console.log(`Wow, you both have equally long names, ${hacker1.length} characters!`);
};

// ITERATION 3

var newHacker1 = "";
for (let i=0; i<hacker1.length; i++) {
newHacker1 += hacker1[i].toUpperCase() + " ";
};
console.log(newHacker1);
var newHacker2 = "";
for (let i=hacker2.length-1; i>-1; i--) {
newHacker2 += hacker2[i];
};
console.log(newHacker2);

//ITERATION 4 (1/2)

hacker1 = "Jean";
hacker2 = "Jeannine";

for(let i=0; i<Math.min(hacker1.length, hacker2.length) ; i++) {
hacker1.toLowerCase();
hacker2.toLowerCase();
if (hacker1[i] < hacker2[i]) {
console.log("The driver's name goes first.");
break;
} else if (hacker1[i] > hacker2[i]) {
console.log("Yo, the navigator goes first definitely.");
break;
} else if (hacker1[i] === hacker2[i]) {
if (i === Math.min(hacker1.length, hacker2.length)-1) {
if (hacker1.length < hacker2.length) {
console.log("The driver's name goes first");
break;
} else if (hacker2.length < hacker1.length){
console.log("Yo, the navigator goes first definitely.");
break;
} else if (hacker2.length === hacker1.length) {
console.log("What?! You both have the same name?");
break;
};
};
};
};

// ITERATION 4 (2/2)

hacker1.toLowerCase();
hacker2.toLowerCase();

let i = 0;

while (i<Math.min(hacker1.length,hacker2.length)) {
if (hacker1 === hacker2) {
console.log("What?! You both have the same name?");
break;
} else if (hacker1[i] < hacker2[i]) {
console.log("The driver's name goes first.");
break;
} else if (hacker1[i] > hacker2[i]) {
console.log("Yo, the navigator goes first definitely.");
break;
} else {
i++;
}
}

if (hacker1.length < hacker2.length) {
console.log("the driver's name comes first");
} else {
console.log("the navigator's name comes first");
}













Envoyer un message à Paul Carillion


À propos de cette conversation


// Iteration 3: Loops
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy