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: You have to perform various number of operations. In one operation, you can choose one index i (1 ≤…

A: In this problem we need to perform various number of operations. In one operation, you can choose…

Q: array of n integers that has been rotated an unknown number of times, write code to find an element…

A: Lets see the solution.

Q: Given an array of integers, return the largest gap between the sorted elements of the array. For…

A: Algorithm - Create a new class with the name main. Now create a method with the name largest gap…

Q: Given an array of size n, find how many times the elements in the array should be shifted left in…

A: <code in java Script> function sortedarray(arr, low, high){ // This condition is needed…

Q: This code calculate the SUM of elements in each row of array T(5,3) and * .stored in array K(5) 1...…

A: This code calculate the SUM on elements in each row of array T(5,3) and stored in array k(5)

Q: Number of students should be 279, not 278 what did I do wrong?

A: Nothing is wrong I run the same code and my ans is 279

Q: Consider the following algorithm: Input: Array A and B both with n integers. Output: Array C with n…

A: According to the algorithm mention we have to find out the tight upper bound on the running time of…

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: In each input array, every number repeats at least once, except for two. Write a function that…

A: The above question is solved in step 2 :-

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: Given a sorted array of n integers that has been rotated an unknown number of times, write code to…

A: The question has been answered in step2

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: ~31. Given the following numbers in array A 18 47 29 30 32 50 40 43 35 24 ... what is the contents…

A: let's see the correct answer of the question

Q: Coaster.java This class represents a roller coaster in the amusement park. It must be a subclass of…

A: Algorithm:Define an abstract class Ride with fields for the ride's name, last inspection date, and…

Q: You have to perform various number of operations. In one operation, you can choose one index i (1 ≤…

A: In this problem, we need to perform various number of operations. In one operation, you can choose…

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: Given a group of characters a circular array ALJ. It is required for each one to print he index of…

A: As given in the question: As in the given example Given a group of characters a circular array AL].…

Q: Using python programming you have to find the minimum number of operations required to modify the…

A: required: You have to perform various number of operations. In one operation, you can choose one…

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…

Q: Find first repeating element in an array of integers in python. Find the first repeating element in…

A: Step 1: Create an initial dictionary entry (index) to record each element's first occurrence when…

Q: You're given an array arr. Apply the following algorithm to it: find intervals of consecutive…

A: This problem involves applying a specific algorithm to an integer array. The algorithm involves…

Q: given an array of lets say 30 items, make a function that prints the highest n values, in this case…

A: Given: Array to sort elements upto 10 steps using easiest sorting Algorithm.

Q: Prime numbers can also be generated by an algorithm known as the Sieve of Eratosthenes

A: Using C++ language

Q: In each input array, every number repeats at least once, except for two. Write a function that…

A: Define a function returnUnique that takes an array arr as input. Create an empty dictionary freq to…

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

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].
3
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
Question # 02: Let’s assume we want to find the largest number in a non-empty array A. A sample solution can be following: def max(A): answer = A[0] for j in range(1,len(A)): // in pseudo-code: for i=1,...,len(A)-1 if (A[j]>answer): answer = A[j] return answer Perform the code correction check including the loop invariance. Question # 03: illustrate the operation of merge sort on the array A = {3; 41; 52; 26; 38; 57; 9; 49}. Question # 04: Answer the following short questions: a) Is 2n+1 = O(2n)? b) Is 22n = O(2n)? c) f(n)=O(g(n)) implies g(n)=O(f(n)) d) f(n) = O((f(n))2)