This assignment will be an exercise in arrays. You will be writing an application.

For this assignment, you will be required to write an implementation the sieve of Eratosthenes. This was the first known algorithm. It finds prime numbers through a process of elimination. Your program should ask the user for a number up to 1000 and print out the primes to that value. It should ask the user if they want to try again and, if so, should repeat.

One of the things you should learn in college is how to research. I would like you to find out about this algorithm by researching it on the internet.

Implement it and for extra credit, optomize it by not searching the entire array. The last part is a little harder, but it is available if you do a little extra research.