Chapter 14, Problem 1PP

Program Plan Intro

Prime numbers up to “n”

Program plan:

• Import necessary packages.
• Create a class “QueueOfPrimes”,
  • Define the method “getPrimes ()” that accepts “n” as parameter,
    • Declare the variable “p”.
    • Create queue of integers.
    • Execute loop to fill the queue with numbers “2” through “n”,
      • Insert the element into the queue.
    • Create queue to store prime numbers.
    • Do the following,
      • Get next prime “p” by removing the first value from the queue.
      • Insert “p” into the queue of primes.
      • Create iterator to loop through queue of integers.
      • Execute loop through queue of numbers,
        • Check whether the number is divisible by “p”,
        • • Remove that value.
    • End the loop while “p” is greater than or equal to the square root of “n”.
    • Insert remaining values into the queue of primes.
    • Return the queue of primes.
  • Define the method “main()”,
    • Construct “Scanner” object.
    • Prompt the user to enter “n”.
    • Get the value of “n” from the user.
    • Print the prime values returned from the method “getPrimes()”.