shway
/
DSA
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Added Prime Number Checker Algorithm:

pull/802/head
WORLDSAVER 2022-08-15 21:41:37 +05:30
parent da4a105bb7
commit 09ec4721ba
1 changed files with 14 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
algorithms/Python/number_theory/prime_number.py
View File

@ -1,16 +1,20 @@
#TO CHECK WHETHER A NUMBER IS PRIME OR NOT #TO CHECK WHETHER A NUMBER IS PRIME OR NOT
N = int(input()) def isPrime(N):
PRIME = True for i in range(2, int(N**0.5) + 1):
if N%i==0:
return False
for i in range(2, int(N**0.5+1)): return True
if N%i==0:
PRIME = False
break
if PRIME: # TIME COMPLEXITY - O(sqrt(N))
print(f"{N} is prime")
else: # EXAMPLES
print(f"{N} is not prime") # print(isPrime(3)) -> True
# print(isPrime(15)) -> False
# We are just checking till sqrt(N) as if their is any factor of a number
# greater than sqrt(N) then it's partner will be less than sqrt(N) as if a*b>N
# and a>=sqrt(N) then b<=sqrt(N) as if b>sqrt(N) then a*b>N.