We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents 633a65f + 8796ef3 commit 24b9663Copy full SHA for 24b9663
Numbers/Sieve.c
@@ -0,0 +1,40 @@
1
+#include <stdio.h>
2
+
3
+int main()
4
+{
5
+ int number,i,j;
6
+ printf("Enter the number\n");
7
+ scanf("%d",&number);
8
9
+ int primes[number+1];
10
11
+ //populating array with naturals numbers
12
+ for(i = 2; i<=number; i++)
13
+ primes[i] = i;
14
15
+ i = 2;
16
+ while ((i*i) <= number)
17
+ {
18
+ if (primes[i] != 0)
19
20
+ for(j=2; j<number; j++)
21
22
+ if (primes[i]*j > number)
23
+ break;
24
+ else
25
+ // Instead of deleteing , making elemnets 0
26
+ primes[primes[i]*j]=0;
27
+ }
28
29
+ i++;
30
31
+ printf("The prime numbers are\n");
32
33
34
+ //If number is not 0 then it is prime
35
+ if (primes[i]!=0)
36
+ printf("%d\t",primes[i]);
37
38
39
+ return 0;
40
+}
0 commit comments