/
rnekrasov
/
Python
Обзор
Документация
Войти
/
rnekrasov
/
Python
Код
Запросы
0
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
check_prime.py
40 строк
983 B
henry-the-vietnamese
fix email
01 окт 2021, 08:34
01 окт 2021, 08:34
9151a3a
Код
Авторство
О чём код?
# Author: Tan Duc Mai # Email: tan.duc.work@gmail.com # Description: Three different functions to check whether a given number is a prime. # Return True if it is a prime, False otherwise. # Those three functions, from a to c, decreases in efficiency # (takes longer time). from math import sqrt def is_prime_a(n): if n < 2: return False sqrt_n = int(sqrt(n)) for i in range(2, sqrt_n + 1): if n % i == 0: return False return True def is_prime_b(n): if n > 1: if n == 2: return True else: for i in range(2, n): if n % i == 0: return False return True return False def is_prime_c(n): divisible = 0 for i in range(1, n + 1): if n % i == 0: divisible += 1 if divisible == 2: return True return False