private void generate5UniqueNumbers (int numbers[ ]) {
      int newNumber = 0;
      boolean numberAlreadyUsed = false;

      for (int index = 0; index < numbers.length; index++) {  // This only needs to happen 5 times: [0] through [4]
            do {
                  numberAlreadyUsed = false;
                  newNumber = getRandomNumber(1, 69);
                  for (int x = 0; x < numbers.length; x++) {          // I compare the new number to ALL elements of the numbers array
                        if (newNumber == numbers[x]) {
                              numberAlreadyUsed = true;
                        }
                   }
             } while (numberAlreadyUsed);    // This could happen any number of times so I used an open-ended do-while loop
             numbers[index] = newNumber;   // Now that the number is not used, I add it to the numbers array
       } //end for
}

private void sortNumbers(int numbers[ ]) {   // A sort from chapter 9
      int j, k, temp;
      for (j = 0; j < NBR_OF_NUMBERS - 1; j++) {
           for (k = 0; k < NBR_OF_NUMBERS - 1; k++) {
                if (numbers[k] > numbers[k + 1]) {
                     temp = numbers[k + 1];
                     numbers [k + 1] = numbers[k];
                     numbers[k] = temp;
                }
           }  //end for
      }  //end for
}