生成器函数找素数

'''
编写一个生成器函数myprimes(start, end)，
实现[start, end)范围内的所有素数计算2 3 5 7. ...
(2,100)
'''

def foo(start,end):
    n = []
    m = []
    for i in range(start,end):
        m.append(i)
        for j in range(2,int(i/2)+1):
            if i % j == 0:
                n.append(i)
                break
    su = list(set(m)-set(n))
    for i in su:
        yield i
def func(start,end):
    for i in foo(start,end):
        print(i)

func(2,10)

版本二：

def myprime(x):
    if x <= 1:
        return False
    for i in range(2, x):
        if x % i == 0:
            return False
    return True
def myprimes(start, end):
    for i in range(start,end):
        if myprime(i):
            yield i
print([x for x in myprimes(1, 10)])