Skip to content

MIA-Richard Batista, Ruben Vargas-lab-javascript-basic-algorithms #89

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

MIA-Richard Batista, Ruben Vargas-lab-javascript-basic-algorithms #89

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
cd1d7fa
Submitting work
blue-stalfos Apr 2, 2018
1d770e5
Delete .DS_Store
blue-stalfos Apr 2, 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
61 changes: 61 additions & 0 deletions starter-code/basic-algorithms.js
100644 → 100755
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,68 @@
// Names and Input
var hacker1 = 'ruben';
console.log("The driver's name is " + hacker1);

var hacker2 = prompt('What is your name?');
console.log('The navigators name is ' + hacker2);

//Conditionals


function compareLength() {
var result;

if (hacker1.length > hacker2.length) {
console.log(
'The Driver has the longest name, it has' + hacker1.length + 'characters'
);
result = 1;
return result;
} else if (hacker1.length < hacker2.length) {
console.log(
'Yo, navigator got the longest name, it has ' +
hacker2.length +
' characters'
);
result = 2;
return result;
} else {
console.log(
'wow, you both got equally long names, ' + hacker2.length + 'characters!!'
);
}
}

compareLength();

function capitalSpace(hacker1) {
hacker1 = hacker1
.split('')
.join(' ')
.toUpperCase();
return hacker1;
}

function reverse(hacker2) {
return hacker2
.split('')
.reverse()
.join('');
}

if (compareLength() === 1) {
var nameLength = hacker1.length;
}
if (compareLength() === 2) {
var nameLength = hacker2.length;
}

// function compareLexOrder(hacker1, hacker2){
// for (var i = 0; i <= nameLength; i++){
// if(hacker1[i] === hacker2[i]
// }
// }

capitalSpace(hacker1);
reverse(hacker2);

// Lorem ipsum generator