Skip to content

MEXPT- Uriel Camargo Fierro #128

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
Leriu wants to merge 2 commits into from
Closed

MEXPT- Uriel Camargo Fierro #128

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
9923274
almost
Leriu Apr 29, 2018
0f1c1f5
se me olvido guardar...
Leriu Apr 29, 2018
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
25 changes: 25 additions & 0 deletions starter-code/basic-algorithms.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,32 @@
// Names and Input
var hacker1 = "Uriel";
var hacker2= window.prompt("¿Cual es tu nombre?");

console.log("The drive is " + hacker1);
console.log("The navigator's name is " + hacker2);

//Conditionals

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("Yo, navigator got the longest name, it has " + hacker2.length + " characters");
}else if(hacker1.length === hacker2.length){
console.log("wow, you both got equally long names, "+ hacker1.length +" characters!!")
}

for(i=0; i< hacker1.length; i++){
console.log(hacker1[i].toUpperCase() + " ");
}


for(i=0; i< hacker2.length; i++){
console.log(hacker2[i]);
}

// Lorem ipsum generator