Consider the following algorithm to find all the prime numbers less than a givenpositive number NStart with all the numbers in an array a[] ={2,3,4,5,...,N-1}.Now, keeping a[0]=2, filter out of this array all other numbers that are divisibleby 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 thatare divisible by 3, leaving {2,3,5,7,11,13,17,...}At the ith iteration, keep a[i], and filter from a[i+l],..., a[L-1], all numbersthat 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 primenumbers.Using the filter pattern discussed in the notes, write a C program thatimplements this algorithm. (There are many algorithms to find prime numbers- the question asks for the implementation of the above algorithm, in order topractise the use of the filter pattern.

#include <stdio.h>#include <stdlib.h> int main(){ int n; printf("Enter the…

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 a[] ={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 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.

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 a[] ={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 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.

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

See similar textbooks

Related questions

Q: Implement a Binary Search algorithm, and using the results from Exercise 5, show how long the Binary…

A: Here's an implementation of the Binary Search algorithm in Python:- def binary_search(arr, target):…

Q: The binary search algorithm that follows may be used to search an array when the elements are in…

A: Note that you'll need to pass an array of strings and the target string to the binary_srch…

Q: complete a prewritten Python program for a carpenter who creates personalized house signs. The…

A: numChars = 8color = 'gold'woodType = 'oak'charge = 0.0charsCharge = 0colorCharge = 0woodCharge = 0…

Q: 1. write algorothim pseudocode. analyze the bestcase .k . analyze the worse case of k.

A: Algorithm: Take the input array and k Create a Priority Queue (max heap) by pushing the values of…

Q: Given an array, that can contain zeros, positive and negative elements. 1. Write an algorithm that…

A: Algorithm: Algo count_Numbers(arr , n) { decalre variables countZero , countPositive ,…

Q: Considering the below array, an algorithm should be written where array of integers are accepted and…

A: Here have to determine about code for sum of array Function.

Q: In this programming, you learn more about efficiency of algorithms based upon run time. Hence you…

A: Solution: In this code, the binarySearch function performs a recursive binary search on the given…

Q: Example: Assume we have this 2Dim array 5 3 2 7 6 9 0 4 0 8 7 6 5 4 6 9 How…

A: Here, all the diagonal elements are changed. To do so we can check the condition where the row and…

Q: The following algorithm adds all the entries in the “upper triangular” part of a square n × n array…

A: the best way to do tracing is to put the values and run code line by line to obtain final value.

Q: Given an integer array nums sorted in non-decreasing order, return an array of the squares of each…

A: Here is the python code of the above problem. See below steps for code.

Q: In this program, what does temp mean at "temp[k]"?

A: Answer: temp mean at "temp[k]" is temp (or temporary) is a variable used to store temporary data…

Question

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 a[] ={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+l],..., 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.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Code :

Output :

Note :

Test Output:

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions

You're given an array arr. Apply the following algorithm to it: find intervals of consecutive prime numbers and consecutive non-prime numbers; replace each such interval with the sum of numbers in it; if the resulting array is different from the initial one, return to step 1, otherwise return the result. Input A non-empty integer array such that: -10000 ≤ arr[i] ≤ 10000 1 ≤ arr.length ≤ 1000 Output An integer array. Examples For arr = [1, 2, 3, 5, 6, 4, 2, 3] the result should be [21, 5]: [1, 2, 3, 5, 6, 4, 2, 3] --> [(1), (2 + 3 + 5), (6 + 4), (2 + 3)] --> [1, 10, 10, 5] [1, 10, 10, 5] --> [(1 + 10 + 10), (5)] --> [21, 5] For arr = [-3, 4, 5, 2, 0, -10] the result should be [1, 7, -10]: [-3, 4, 5, 2, 0, -10] --> [(-3 + 4), (5 + 2), (0 + -10)] --> [1, 7, -10] Solve it in C# please
Prime numbers can also be generated by an algorithm known as the Sieve of Eratosthenes . The algorithm for this procedure is presented here. Write a program that implements this algorithm so as to find all prime numbers up to n = 150. Sieve of Eratosthenes Algorithm To Display All Prime Numbers Between 1 and n Step 1: Define an array of integers P . Set all elements P i to 0, 2 <= i <= n. Step 2: Set i to 2. Step 3: If i > n , the algorithm terminates. Step 4: If P i is 0 (value i is a prime number), then i is prime and display its value. Step 5: For all positive integer values of j , such that i * j ≤ n , set P i ∗ j to 1 (non - prime). Step 6: Add 1 to i and go to step 3
Given n arrays, each array contain n positive integers. Write an O (n² log n) algorithm to find the smallest n sums out of nn possible sums that can be obtained by picking one positive integer from each of n arrays. For example, given three arrays as follows: [5, 1, 8], [5, 2,9], and [6,7, 10]. The smallest n sums of the given array is [9, 10, 12].
you are given integers A = [a0, a1, a2, · · · an], where a are integers. We want to determine the largest sum of a portion of consecutive values in the array. array A = [3, 13, −20, 9, −3, 30, 9, −70], largest sum of a portion of consecutive values is 9-3+30+9 = 45. a) you must write an iterative algorithm that can determine the largest sum of a portion of consecutive values / show the time complexity b)Write a dynamic programming-based algorithm that determines the largest sum of a portion of consecutive values/show its time complexity
do not plagiarise