Skip to content

[BCN - PT -122019] - Thibault Delfaud #590

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

[BCN - PT -122019] - Thibault Delfaud #590

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b5693d2
Done!
Thibault-d Dec 19, 2019
556cdb5
added bonus 1
Thibault-d Dec 19, 2019
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
88 changes: 85 additions & 3 deletions js/index.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,89 @@
// Iteration 1: Names and Input
let hacker1="thibault", hacker2="pauline", differencia =0;

console.log(`The driver's name is ${hacker1}`);
console.log(`The navigator's name is ${hacker2}`);


// WHICH NAME IS THE LONGEST

differencia = hacker1.length - hacker2.length; //easier to find which is longer depending on if the difference is positive or negative

if (differencia >0) {
console.log(`The driver has the longest name, it has ${hacker1.length} characters.`);
} else if (differencia < 0) {
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!`);
}


//HACKER1 IN CAPITAL LETTERS

function driverCapital(name) {
for(i=0;i <= name.length;i++) {
letter = name.substring(i,i+1); //look for each letter in the string depending on its index
console.log(letter.toUpperCase()); //uppercase the letter at the "i" index
}
}

driverCapital(hacker1);


//HACKER2 IN REVERSE

function navigatorReverse(name) {
for(i= name.length;i >=0 ;i--) { //start from the index of the last caracter and decrease "i"
console.log(name.substring(i,i+1));
}
}

navigatorReverse(hacker2);

//ALPHABETICAL ORDER

function lexicoOrder(name1, name2) { //use of the localeCompare function, returns 1 if name2 is before name1
if (hacker1.localeCompare(hacker2)>0) {
console.log("Yo, the navigator goes first definitely.");
} else if(hacker1.localeCompare(hacker2)<0) {
console.log("The driver's name goes first.")
} else {
console.log("What?! You both have the same name?")
}
}

lexicoOrder(hacker1, hacker2);


//BONUS1

let bonus1= ("is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s with the release of Letraset sheets containing Lorem Ipsum passages, and more recently with desktop publishing software like Aldus PageMaker including versions of Lorem Ipsum")


// NUMBER OF WORDS

function countWords(string) {
test = [];
test = string.split(" "); //create one array element everytime there's a space
console.log(`BONUS1: the paragraph contains ${test.length} words`); //count number of elements in array = number of words
}

countWords(bonus1);

// NUMBER OF "ET" OCCURENCES

function countEt(string) {
let count = 0;
for (i = 0; i < string.length; i++) {
let match;
match = string[i].includes("et"); //look if each element of the array contains the string
if (match == true) {
count++; //count the number of occurences by incrementing count
}
}
console.log(`The text containts ${count} occurences of the string "et"`);
}

countEt(test);

// Iteration 2: Conditionals


// Iteration 3: Loops