数组中的最大素数

import math

def is_prime(num):
    if num < 2:
        return False
    for i in range(2, int(math.sqrt(num)) + 1):
        if num % i == 0:
            return False
    return True

def find_largest_prime(arr):
    largest_prime = None
    for num in arr:
        if is_prime(num):
            if largest_prime is None or num > largest_prime:
                largest_prime = num
    return largest_prime

# 示例数组
array = [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20]

largest_prime = find_largest_prime(array)
print("数组中的最大素数是:", largest_prime)

数组中的最大素数是: 19