Added Prime Number Checker Algorithm:

algorithms/Python/number_theory/prime_number.py

@@ -1,16 +1,20 @@
 #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):
-
-for i in range(2, int(N**0.5+1)):
                 if N%i==0:
-		PRIME = False 
+                        return False
-		break 
 
-if PRIME:
+        return True
-	print(f"{N} is prime")
+
-else:
+# TIME COMPLEXITY - O(sqrt(N))
-	print(f"{N} is not prime")
+
+# EXAMPLES
+# 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.