/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

1 vote157 views1 answer
Matlab find in python
Python
4 votes172 views3 answers
Csv to json
Python
2 votes163 views1 answer
All alphanumeric characters for python python
Python
1 vote181 views1 answer
Db_index django
Python
0 vote158 views1 answer
Python break list into n lists
Python
1 vote166 views2 answers
Discord py get channel ID by name
Python
0 vote169 views1 answer
Python byte like to string
Python
3 votes152 views1 answer
Print the heat map python
Python
0 vote182 views1 answer
Stop a subprocess python
Python
0 vote214 views1 answer
Iloc[:,0:-1]
Python