Write down an algorithm for checking the number is prime number or not
Answers
Answered by
2
read the number n.
Check the divisibility of the number from 2 to n/2.
If number is divisible by any of the numbers above . It isn't prime
Else it is prime.
Check the divisibility of the number from 2 to n/2.
If number is divisible by any of the numbers above . It isn't prime
Else it is prime.
Similar questions