From dccc88bb1f9addc63e1acfade6b624ed950327ea Mon Sep 17 00:00:00 2001 From: Victoria Hickam Date: Thu, 24 Jan 2019 12:33:20 -0500 Subject: [PATCH] done --- .DS_Store | Bin 0 -> 6148 bytes starter-code/basic-algorithms.js | 100 ++++++++++++++++++++++++++++++- 2 files changed, 97 insertions(+), 3 deletions(-) create mode 100644 .DS_Store diff --git a/.DS_Store b/.DS_Store new file mode 100644 index 0000000000000000000000000000000000000000..8489c6b6a93754c79a0c056c58f3682a9de0c5b3 GIT binary patch literal 6148 zcmeHK&2AGh5FV$2dIN|YD$%1aNE||y5ZWFP(vqf!9FP!Ol>KK1HC~}V`)Ld#fQL{( z2_X!zOt5?ohoB*bWRT7AE`FC6jf)dE-(_@?rA66p{}8pM`n~(hQZ{7cQR7o^q{l%S zmZPE<4nI=uU05DPF5b~PyNbhTH%-R-&6O>kmtmSGLqksE1XK1tq>d7ZhJFf=^$6voqzE4ljj1(a7*Ejaq z;SA0(xK*ex!7$Hs{uy&-{27mt6<`Hefjd{gZ9MY9ozKJ*umY^Wzor1~4+@>ocUW08 zTL%{A34ln~NMjh&g^@VQq3^J=h&^b+QV}gxxF?3NbZl2H&v#f^v~&>e@gdyI!o5(0 znH|ShCLM%tkxN#96_{6G$yS?m{%_y@{+}mtjTK-8{woDUy&v>@_(|?;UHCXUYZdwd rIvM3v7OyB6n4=hT=_p=BH-_zs0z}_oWf5D@_#$9r;DQzSqYC^2nc8qg literal 0 HcmV?d00001 diff --git a/starter-code/basic-algorithms.js b/starter-code/basic-algorithms.js index 82f20d8ba..8da019b90 100644 --- a/starter-code/basic-algorithms.js +++ b/starter-code/basic-algorithms.js @@ -1,7 +1,101 @@ -// Names and Input +var hacker1 = "samantha"; +console.log("The driver's name is " + hacker1); +var hacker2 = prompt("Enter name"); +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(hacker2.length > hacker1.length){ + console.log("The Navigator has the longest name, it has " + hacker2.length + " characters"); +} +else { + console.log("wow, you both got equally long names, " + hacker1.length + " characters!!") +} -// Lorem ipsum generator +var d = ""; +for (var i = 0; i < hacker1.length; i++){ + d += hacker1[i].toUpperCase() + " "; +} +console.log(d); + +var n = ""; +for (var i = hacker2.length-1; i >= 0; i--){ + n += hacker2[i]; +} +console.log(n); + +var longest = ""; +var maxLength; +if(hacker1.length > hacker2.length){ + longest = hacker1; + maxLength = hacker1.length; +} +else if (hacker2.length > hacker1.length){ + longest = hacker2; + maxLength = hacker2.length; +} +else { + maxLength = hacker1.length; +} + + +for(i = 0; i