[LIS WDFT APRIL23] - Lab1 DONE, Gustavo Couto + Bernardo Abreu

index.js

@@ -1,7 +1,62 @@
 // Iteration 1: Names and Input
+let hacker1 = `Gustavo`;
+let driver = `The driver's name is ${hacker1}`;
+console.log(driver);
 
+let hacker2 = `Bernardo`;
+let navigator = `The navigator's name is ${hacker2}`;
+console.log(navigator);
 
 // Iteration 2: Conditionals
 
+if(hacker1.length>hacker2.length) {
+    console.log("The driver has the longest name, it has "+ hacker1.length + " caracters");
+}else if(hacker1.length<hacker2.length) {
+        console.log("It seems that the navigator has the longest name, it has " + hacker2.length + " caracters");
+
+}else{
+        console.log("Wow, you both have equaly long names " + hacker2.length + " caracters");
+    }
 
 // Iteration 3: Loops
+
+
+ /*function addSpace(upperCaseDriver) {
+    let result = '';
+  /// Acrescentar um espaço para cada caracter 
+    for (const char of upperCaseDriver) {
+      result += char.toUpperCase() + ' ';
+    }
+/// 
+    return result;
+  }
+
+  console.log(addSpace(hacker1)); */
+
+  let espaço = "";
+  for (let i = 0; i <hacker1.length; i++) {
+    espaço += hacker1[i].toUpperCase() + " ";
+  }
+  console.log(espaço.trimEnd());
+
+/// NOME INVERTIDO
+
+let hacker2Invert = "";
+for (let i = hacker2.length -1; i>=0; i--) {
+    let char = hacker2[i];
+    hacker2Invert += char;
+}
+console.log(hacker2Invert);
+
+///
+let OrdemAlphabetica = (hacker1.localeCompare(hacker2));
+
+
+if(OrdemAlphabetica==-1) {
+    console.log("The driver's name goes first");
+}else if(OrdemAlphabetica==1) {
+        console.log("Yo, the navigator goes first definitely");
+
+}else{
+        console.log("What ?! You both have the same name");
+    }