An array of prime numbers 2-499 is stored in a file "primeNumbers.txt". This program can allow to request a number from the user and find the closest prime number to the input number (either higher or lower) and print the lower one if the number is in the middle of two. Your program should run interactively until the user quits. Try to minimize the program execution time by using the appropriate searching method for finding the prime number(s). You need to record and report the number of comparisons executed for finding the prime numbers. Sample Output Enter a number between 2 and 499.1 This number is outside the accepted range.

EBK JAVA PROGRAMMING
9th Edition
ISBN:9781337671385
Author:FARRELL
Publisher:FARRELL
Chapter9: Advanced Array Concepts
Section: Chapter Questions
Problem 7PE
icon
Related questions
Question

Alert dont submit AI generated answer.

An array of prime numbers 2-499 is stored in a file "primeNumbers.txt". This program can allow to request a number from the user and
find the closest prime number to the input number (either higher or lower) and print the lower one if the number is in the middle of two.
Your program should run interactively until the user quits. Try to minimize the program execution time by using the appropriate
searching method for finding the prime number(s). You need to record and report the number of comparisons executed for finding the
prime numbers.
Sample Output
Enter a number between 2 and 499:1
This number is outside the accepted range.
Do you want to continue (y/n)?y
Enter a number between 2 and 499:223
The closest prime is 223
The number of comparisons is:1
Do you want to continue (y/n)?y
Enter a number between 2 and 499:354
The closest prime is:353
The number of comparisons is:7
Do you want to continue (y/n)?y
Enter a number between 2 and 499:495
The closest prime is:491
The number of comparisons is:7
Do you want to continue (y/n)?n
Goodbye!
Transcribed Image Text:An array of prime numbers 2-499 is stored in a file "primeNumbers.txt". This program can allow to request a number from the user and find the closest prime number to the input number (either higher or lower) and print the lower one if the number is in the middle of two. Your program should run interactively until the user quits. Try to minimize the program execution time by using the appropriate searching method for finding the prime number(s). You need to record and report the number of comparisons executed for finding the prime numbers. Sample Output Enter a number between 2 and 499:1 This number is outside the accepted range. Do you want to continue (y/n)?y Enter a number between 2 and 499:223 The closest prime is 223 The number of comparisons is:1 Do you want to continue (y/n)?y Enter a number between 2 and 499:354 The closest prime is:353 The number of comparisons is:7 Do you want to continue (y/n)?y Enter a number between 2 and 499:495 The closest prime is:491 The number of comparisons is:7 Do you want to continue (y/n)?n Goodbye!
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT