/Python/Effient way to find prime no inpython

Effient way to find prime no inpython

num = 13
if num > 1:
for i in range(2, num//2):
if (num % i) == 0:
print(num, "is not a prime number")
break
else:
print(num, "is a prime number")
else:
print(num, "is not a prime number")

Source: edureka.co

Similar codes

0 vote274 views1 answer
Programmer tool
Python
0 vote290 views1 answer
Python pop a element by index
Python
0 vote273 views1 answer
Current Issue.status = 'Closed';
Python
0 vote279 views1 answer
Gdscript tween
Python
0 vote281 views1 answer
Python string: escaping characters
Python
2 votes280 views1 answer
Mario dance dance revolution
Python
1 vote270 views1 answer
Fruit shop using list in python
Python
1 vote294 views1 answer
Cannot import name 'abc' from 'bson.py3compat'
Python
0 vote281 views1 answer
Selenium how to handle element not found python
Python
0 vote270 views1 answer
Return a new RDD containing only the elements that satisfy a predicate.
Python