如何编写Python递归算法来查找两个值(来自user)之间的回文素数？

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

def is_palindrome(num):
    return str(num) == str(num)[::-1]

def find_palindrome_primes(start, end):
    if start > end:
        return []
    if is_prime(start) and is_palindrome(start):
        return [start] + find_palindrome_primes(start + 1, end)
    else:
        return find_palindrome_primes(start + 1, end)

start = int(input("请输入起始值："))
end = int(input("请输入结束值："))

result = find_palindrome_primes(start, end)
print("起始值和结束值之间的回文素数为：", result)