Matlab code for Eratosthenes

Question

0 个投票

I wrote a code for the sieve of Eratosthenes, but the grader was not satisfied with my code. I'm not sure what I did wrong to his eyes. Any ideas? Please and thank you!

function p = prime_seive(n)
p = [0 2:n];   
for k = 2:sqrt(n)
    
if p(k)   
p(k^2:k:n) = 0;
end
end
p = p(p ~= 0);
end

5 个评论
显示 3更早的评论隐藏 3更早的评论

Aaron Millan 2021-4-29

Thankfully, they didn't ask for any specific vector orientation. I can't post a picture of the instructions here due to copyright, but let me wite out the two theorems they wanted included:

1) if c is not divisible by any number less than c, then c is prime

2) If c is not divisible by any interger between 2 and sqrt(n), then c is prime

Maybe he was just being a stickler for the pervious parts.