查找数字的最大素数因子的算法

def is_prime(n):
    if n <= 1:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

def largest_prime_factor(n):
    largest = 1
    while n % 2 == 0:
        largest = 2
        n //= 2
    for i in range(3, int(n**0.5) + 1, 2):
        while n % i == 0:
            largest = i
            n //= i
    if n > 2:
        largest = n
    return largest

n = 123456789
largest = largest_prime_factor(n)
print(largest)