//COMPUTER SCIENCE 161.01
//MONDAY APRIL 10th 2017
//SEQUENTIAL SEARCH (a.k.a. LINEAR SEARCH)


lastNames = new Array("Hurdle",  "Nottingham", "Clark", "Morris", 
                      "Ortiz", "Hardman", "Fairchild", "Dickerson", 
                      "Sadler", "Parke", "Shaheen", "Smith",
                      "Borbonie", "Moss", "Garcia" );

firstNames  = new Array("Gray", "Will", "Richard", "Robert",
                       "Austin", "Austin", "Austin", "Jack",
                       "Miles", "Jordan", "Chandler", "Alex",
                       "Korbin", "Landon", "Alex" );




desiredName = prompt("Enter the last name of the person you wish to greet:");

//NOW, LET'S WRITE A LOOP TO GREET THIS PERSON USING HIS FIRST NAME

i=0;
found = false;

while (found == false && i < lastNames.length) {
  if (lastNames[i] == desiredName)  //IF CURRENT lastName MATCHES desiredName 
  {     found = true;
  	alert("Happy Monday to " + firstNames[i]);  
                              //THEN send a friendly greeting using firstName
  }
  else
    i++;
}

if (found == false) 
  alert("could not find " + desiredName);

alert("ALL DONE");