查找1至20代码之间的质数而不返回质数2，什么是正确的算法？

Question

Finding prime numbers between 1 to 20

a = []
for i in range(2,20):
    for j in range(2,20):
        if((i % j) == 0):
            break;
        else:
            a.append(i)
return a

This is the output I got -

[3, 5, 5, 5, 7, 7, 7, 7, 7, 9, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 15, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19]

I expect 2 should also be included in the output

Answer 1

You misplaced the else , which makes the sieve dysfunctional. In addition the inner loop should only iterate until j == i - 1 . The correct code would look like this:

a = []
for i in range(2,20):
    for j in range(2,i):
        if((i % j) == 0):
            break
    else:
        a.append(i)
return a

The difference: in the original code any i for which a j is found, such that i % j != 0 , will be appended to a . With the corrected code, i will only be appended, if the inner loop isn't terminated by a break . Also your code tests for divisibility for all numbers in the range [2, 20[ , but even primes are divisible by themselves, which is why 2 wasn't part of the output of your code.

Answer 2

In the first iteration of the two loops - i=2 and j=2 . The if condition is then true and therefore the inner loop stops without adding 2 to a .