How to find prime and composite numbers by the method " Sieve of Erathosthenes".
Answers
Answered by
3
Answer:
Prime Number Program In C
Algorithm. Algorithm of this program is very easy − START Step 1 → Take integer variable A Step 2 → Divide the variable A with (A-1 to 2) Step 3 → If A is divisible by any value (A-1 to 2) it is not prime Step 4 → Else it is prime STOP.
Pseudocode. ...
Implementation. ...
Output.
Similar questions