forked from ironhack-labs/lab-javascript-basic-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathindex.js
More file actions
51 lines (37 loc) · 1.3 KB
/
Copy pathindex.js
File metadata and controls
51 lines (37 loc) · 1.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
// Iteration 1: Names and Input
//1.1 Create a variable with the driver's name
const hacker1 = "Alice";
//1.2 Print the driver's name
console.log("The driver's name is " + hacker1);
//1.3 Create a variable with the navigator's name
const hacker2 = "Jack";
//1.4 Print the navigator's name
console.log("The navigator's name is " + hacker2);
// Iteration 2: Conditionals
//Comparing name length with conditions
if(hacker1.length > hacker2.length) {
console.log(`The driver has the longest name, it has ${hacker1.length}
characters.`);
}
else if (hacker2.length > hacker1.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: Loops
//3.1
const spacedName = hacker1.toUpperCase().split('').join('');
console.log(spacedName);
//3.2
const reversedName = hacker2.split('').reverse().join('');
console.log(reversedName);
//3.3 lexicological order//
if (hacker1 < hacker2) {
console.log(`The driver's name goes first.`);
} else if (hacker1 > hacker2) {
console.log(`Yo, the navigator goes first, definitely.`);
} else {
console.log(`What?! You both have the same name?`);
}