Python Project #2-Prime number method #1
Hello friends...
Today's program:
WAP to find whether the given
number is prime or not???
This can be done in three ways:
1. Loop from 1 to n
2. Loop from 1 to n/2
3. Loop from 1 to square root of n
**FIRST METHOD IS SHOWN HERE**
The time taken to execute the code is "7.625 seconds"
The code snippet can be found in the GitHub repository.
https://github.com/avinash90000/Prime...
For better run time watch the next video.
Link for next video:
• Python Project #2-Prime Number method #2
Subscribe for more content...