Question 6 5 pts The Sieve of Eratosthenes is a method used to computer all prime...

Transcribed Image Text:

Question 6 5 pts The Sieve of Eratosthenes is a method used to computer all prime numbers 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, etch . when i > N the algorithm terminates. What is the running time of the algorithm? Research Knuth on this particular problem. Question 6 5 pts The Sieve of Eratosthenes is a method used to computer all prime numbers 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, etch . when i > N the algorithm terminates. What is the running time of the algorithm? Research Knuth on this particular problem.