pa help naman po guys pano icompute to huhu
algorithm Sieve of Eratosthenes is
input: an integer n > 1.
output: all prime numbers from 2 through n.
let A be an array of Boolean values, indexed by integers 2 ton, initially all set to true.
for i = 2, 3, 4, ..., not exceeding √n do
if A is true...