Consider the following algorithm to find all the prime numbers less than a given positive number N Start with all the numbers in an array al =(2,3,4,5,...,N-1). Now, keeping a[0]=2, filter out of this array all other numbers that are divisible by 2 to leave {2,3,5,7,9,11,13,15,17.) Next, keeping a[1]=3, filter out of the remainder of the array, all numbers that are divisible by 3, leaving {2,3,5,7,11,13,17,..} At the ith iteration, keep all), and filter from a[i+1)..a[L-1), all numbers that are divisible by a[i), where L is the current length of the array. By the end of this process, all the numbers remaining in the array are prime numbers. Using the filter pattern discussed in the notes, write a C program that implements this algorithm. (There are many algorithms to find prime numbers - the question asks for the implementation of the above algorithm, in order to practise the use of the filter pattern. expects that the number N is read from the keyboard and that the numbers are written out on a single line with spaces between them. For example: Input Result Enter the upper limit: 10 2 357 100 Enter the upper limit: 2 357 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
Consider the following algorithm to find all the prime numbers less than a given positive number N Start with all the numbers in an array al =(2,3,4,5,...,N-1). Now, keeping a[0]=2, filter out of this array all other numbers that are divisible by 2 to leave {2,3,5,7,9,11,13,15,17.) Next, keeping a[1]=3, filter out of the remainder of the array, all numbers that are divisible by 3, leaving {2,3,5,7,11,13,17,..} At the ith iteration, keep all), and filter from a[i+1)..a[L-1), all numbers that are divisible by a[i), where L is the current length of the array. By the end of this process, all the numbers remaining in the array are prime numbers. Using the filter pattern discussed in the notes, write a C program that implements this algorithm. (There are many algorithms to find prime numbers - the question asks for the implementation of the above algorithm, in order to practise the use of the filter pattern. expects that the number N is read from the keyboard and that the numbers are written out on a single line with spaces between them. For example: Input Result Enter the upper limit: 10 2 357 100 Enter the upper limit: 2 357 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
In c
![Consider the following algorithm to find all the prime numbers less than a given positive
number N
Start with all the numbers in an array al ={2,3,4,5,.N-1}.
Now, keeping a[0]=2, filter out of this array all other numbers that are divisible by 2 to
leave {2,3,5,7,9,11,13,15,17.}
Next, keeping a[1]=3, filter out of the remainder of the array, all numbers that are divisible
by 3, leaving {2,3,5,7,11,13,17,.}
At the ith iteration, keep a[i], and filter from a[i+1],..a[L-1], all numbers that are divisible
by alil, where L is the current length of the array.
By the end of this process, all the numbers remaining in the array are prime numbers.
Using the filter pattern discussed in the notes, write a C program that implements this
algorithm. (There are many algorithms to find prime numbers - the question asks for the
implementation of the above algorithm, in order to practise the use of the filter pattern.
expects that the number N is read from the keyboard and that the numbers are written out
on a single line with spaces between them.
For example:
Input Result
10
Enter the upper limit:
2 357
100
Enter the upper limit:
2 357 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79
83 89 97](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa45605aa-78e9-4875-8b8e-09c3d59f8b7a%2F88b23cad-bd28-47c8-a024-2f32578b8711%2F50mq1d_processed.png&w=3840&q=75)
Transcribed Image Text:Consider the following algorithm to find all the prime numbers less than a given positive
number N
Start with all the numbers in an array al ={2,3,4,5,.N-1}.
Now, keeping a[0]=2, filter out of this array all other numbers that are divisible by 2 to
leave {2,3,5,7,9,11,13,15,17.}
Next, keeping a[1]=3, filter out of the remainder of the array, all numbers that are divisible
by 3, leaving {2,3,5,7,11,13,17,.}
At the ith iteration, keep a[i], and filter from a[i+1],..a[L-1], all numbers that are divisible
by alil, where L is the current length of the array.
By the end of this process, all the numbers remaining in the array are prime numbers.
Using the filter pattern discussed in the notes, write a C program that implements this
algorithm. (There are many algorithms to find prime numbers - the question asks for the
implementation of the above algorithm, in order to practise the use of the filter pattern.
expects that the number N is read from the keyboard and that the numbers are written out
on a single line with spaces between them.
For example:
Input Result
10
Enter the upper limit:
2 357
100
Enter the upper limit:
2 357 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79
83 89 97
![int main(void)
{
int a[MAX_SIZE);
int N;
int L; * the current size of the list */
* read in the upper limit. Keep reading until
a valid number between 3 and the maximum that
can be handled by the array is entered /
printf("Enter the upper limit:\n");
do {
scanf("%d", &N);
} while (N<3 || N>MAX_SIZE+2);
* write your solution here . /
* write out the result - DO NOT CHANGE THIS /
for(i=0;i<L;i++)
printf("%d ",a[i]);
printf("\n");
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa45605aa-78e9-4875-8b8e-09c3d59f8b7a%2F88b23cad-bd28-47c8-a024-2f32578b8711%2Fvwbilk7_processed.png&w=3840&q=75)
Transcribed Image Text:int main(void)
{
int a[MAX_SIZE);
int N;
int L; * the current size of the list */
* read in the upper limit. Keep reading until
a valid number between 3 and the maximum that
can be handled by the array is entered /
printf("Enter the upper limit:\n");
do {
scanf("%d", &N);
} while (N<3 || N>MAX_SIZE+2);
* write your solution here . /
* write out the result - DO NOT CHANGE THIS /
for(i=0;i<L;i++)
printf("%d ",a[i]);
printf("\n");
}
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education