Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
913 views
in Computer by (69.7k points)

Design an algorithm to generate all the primes in the first n positive integers.

1 Answer

+1 vote
by (69.2k points)
selected by
 
Best answer

This algorithm will generate all prime numbers less than n.

void prime()

{

int i,n,j;

printf("enter any number");

scanf("%d",&n);/*scan the number */ i=2;

while(i<n)

{ j=2;

while(j<=i-1)

{

if(i%j==0)

break;

else

j++;

}

if(j==i)

printf("%d\n",i);

i++;

}

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...