Breaking News: Grepper is joining You.com. Read the official announcement!

prime numbers using sieve algorithm in c

Real Rook answered on November 9, 2022 Popularity 3/10 Helpfulness 1/10

answer prime numbers using sieve algorithm in c

prime numbers using sieve algorithm in c

Comment

#include<stdio.h>
int main()
{
	int n;
	printf("Enter n value: ");
	scanf("%d", &n);
	int prime[n+1];
	//Loading the array with numbers from 1 to n
	for(int i = 1; i <= n; i++)
	{
		prime[i] = i;
	}
	//Start with least prime number, which is 2.
	//No need to check for numbers greater than square root of n.
	//They will be already marked.
	for(int i = 2; i*i <= n; i++)
	{
		if(prime[i] != -1)
		{
			//Mark all the multiples of i as -1.
			for(int j = 2*i; j <=n ; j += i)
				prime[j] = -1;
		}
	}
	printf("Prime numbers are: \n");
	for(int i=2; i <= n; i++)
	{
		if(prime[i] != -1)
		{
			printf("%d ", i);
		}
	}
}

Popularity 3/10 Helpfulness 1/10 Language c

Source: www.startertutorials.com

Tags: algorithm c numbers sieve using

Link to this answer
Share Copy Link