堅持本系列一貫的風格，不多廢話，直接上程式碼。

def print_prime(n):
    i = 2
    while i < n:
        if i == 1 or i == 2:
            print(i, end=' ')
            i = i+1
            continue
        j = 2
        is_prime = True
        while j<i:
            if i % j == 0:
                is_prime = False
            j = j+1
        if is_prime == True:
            print(i, end=' ')
        i = i + 1
    print()
 

# ---------------------------------
# Print Prime number
# ---------------------------------
def is_prime(n):
    j=2
    while j<n:
        if n%j==0:
            return False
        j = j+1
    return  True

def print_prime(n):
    i=2
    while i<n:
        if is_prime(i) == True:
            print(i, end=' ')
        i=i+1
    print()