Consider the following pseudocode. What does it produce?
Create a list of consecutive integers from two to n: (2, 3, 4, ..., n).
Initially, let p equal 2.
Repeat following steps until p2 is greater than n
Strike from the list all multiples of p less than or equal to n.
Find the first number remaining on the list greater than p.
Replace p with this number.
A) All even numbers up to n
B) All Fibonacci numbers up to n
C) All prime numbers up to n
D) All factorial numbers up to n

Question

Quizplus · Accepted Answer

This pseudocode implements the sieve of Eratosthenes, which is a well-known algorithm for finding all prime numbers up to a given limit. The algorithm starts by creating a list of consecutive integers from 2 to n. Then, it repeatedly strikes out all multiples of the current prime number p (starting with 2) until p^2 exceeds n. After that, it replaces p with the next number on the list that is greater than p and has not been struck out. This process continues until all primes up to n have been found. Therefore, the correct choice is C, which corresponds to "All prime numbers up to n".

Consider the Following Pseudocode. What Does It Produce