Write a java program to compute all prime numbers less than equal to a given integer N using the algorithm "Sieve of Eratosthenes". 

The Sieve of Eratosthenes is a method used to compute all primes less than N. We begin by making a table of integers 2 to N. We find the smallest integer, i that is not crossed out, print I, and cross out I, 2i, 3i, ....When i is > √N, the algorithm terminates. 

Prompt the user to give an integer value of N and print all primes up till N using the above algorithm on screen.

Answer rating: 100% (QA)

java program to compute all prime numbers less than equa... View the full answer