求质数，优化

优化前

import math
def prime(n):
    if n%2 == 0:
        return n==2
    if n%3 == 0:
        return n==3
    if n%5 == 0:
        return n==5
    for p in range(7,int(math.sqrt(n))+1,2):    #只考虑奇数作为可能因子
        if n%p == 0:
            return 0
    return 1

if __name__ == "__main__":
    n = int(input(">>"))
    count = 0
    star_time = time.time()
    for i in range(2, n + 1):  # 1不是素数,从2开始
        if prime1(i):
            # print(i)
            count += 1
    print(count)
    end_time = time.time()
    print(end_time - star_time)

---

执行结果:

>>2000000
148933
5.532246351242065

优化后

def prime(n):
    flag = [1] * (n + 2)
    p = 2  # 第一个质数
    count = 0  # 用于计算质数的数量
    while (p <= n):
        # print(p)
        count += 1
        # 把质数的倍数，设为非质数
        for i in range(2 * p, n + 1, p):
            flag[i] = 0
        # 找出下一个质数
        while 1:
            p += 1  # p自增
            if (flag[p] == 1):  # 当p是质数，跳出内层循环
                break
    print(count)


# test
if __name__ == "__main__":
    n = int(input(">>"))
    star_time = time.time()
    prime(n)
    end_time = time.time()
    print(end_time - star_time)

---

执行结果:

>>2000000
148933
0.5664565563201904