From 8b316cec104659a30c1a49725e89c1d6216f6ef9 Mon Sep 17 00:00:00 2001
From: hex-plex <56990337+hex-plex@users.noreply.github.com>
Date: Mon, 28 Oct 2019 10:23:41 +0530
Subject: [PATCH] Cuts the run time to half

its useful if we make the loop go only to integer less than a/2 as ((a)/(a/2))==2 and ((a)/(a))==1 so  ((a)/(x)) for x a/2<x<a will have (a%x)!=0
always by simple  analysis
---
 check_if_prime.py | 20 ++++++++------------
 1 file changed, 8 insertions(+), 12 deletions(-)

diff --git a/check_if_prime.py b/check_if_prime.py
index 7c557f3..be3ed55 100644
--- a/check_if_prime.py
+++ b/check_if_prime.py
@@ -1,14 +1,10 @@
 def is_prime(a):
-    x = True 
-    for i in (2, a):
-            while x:
-               if a%i == 0:
-                   x = False
-               else:
-                   x = True
-
-
+    x = True
+    for j in range(2,int(a/2)):
+        if(a%j==0):
+            x=False
+            break
     if x:
-        print "prime"
-    else:
-        print "not prime"
+        print("Its a Prime")
+    else: 
+        print("Its not a Prime")