Naturally, for bool isprime(number) there would be a data structure I could query. I define the best algorithm, to be the algorithm that pr
bool isprime(number)
import math import time def check_prime(n): if n == 1: return False if n == 2: return True if n % 2 == 0: return False from_i = 3 to_i = math.sqrt(n) + 1 for i in range(from_i, int(to_i), 2): if n % i == 0: return False return True