https://technotip.com/9414/find-prime...
Lets write a C program to find prime numbers from 2 to N, using Sieve of Eratosthenes method.
Important Note
We are working on index numbers here. Array elements will have only 2 values: 1 or 0. Wherever the value of array element is 1, that means it’s position/index number is prime orelse its composite number.
C Programming Interview / Viva Q&A List
https://technotip.com/6378/c-programm...
C Programming: Beginner To Advance To Expert
https://technotip.com/6086/c-programm...
Join this channel to get access to perks:
/ @technotipdotorg