Question

Finding prime numbers in algorithm, flow chart and pseudocode

Answer 1

Answer:

Following is the algorithm to find all the prime numbers less than or equal to a given integer n by Eratosthenes' method: Create a list of consecutive integers from 2 to n: (2, 3, 4, …, n). Initially, let p equal 2, the first prime number