Implementation of sieve algorithm Program plan: Define the “sieve_era()” function, Create empty list. Create “while” loop, Append the first element to the new list using “append()” method. Make a “try” statement for exception. Create “for” loop, Check whether the list element is divided by the first element. If it is “True” remove the element. If any exception occurs, handle the exception, Keep the new list. Return new list. Define the “main()” function, Get the input from the user. Create empty list. Create “for” loop, Fill the new list using “append()” method. Assign the list return from “sieve_era()” function. Remove the element “4” from the list. Print the list. Call the “main()” function.

Question

Want to see the full answer?

Answer 1

Question

Chapter 11, Problem 10PE

Program Plan Intro

Implementation of sieve algorithm

Program plan:

Define the “sieve_era()” function,

Create empty list.

Create “while” loop,

Append the first element to the new list using “append()” method.

Make a “try” statement for exception.

Create “for” loop,

Check whether the list element is divided by the first element.

If it is “True” remove the element.

If any exception occurs, handle the exception,

Keep the new list.

Return new list.

Define the “main()” function,

Get the input from the user.

Create empty list.

Create “for” loop,

Fill the new list using “append()” method.

Assign the list return from “sieve_era()” function.

Remove the element “4” from the list.

Print the list.

Call the “main()” function.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Given a list of integers, you want to know whether it is possible to divide the integers into two sets, so that the sum of one set is odd, and the sum of the other set is a multiple of 10. Every integer must be in one set or the other. You can write a recursive helper method that takes any number of arguments and then call it inside the method, but you cannot use any loops. Test cases: oddAndTen([5, 5, 3]) true oddAndTen ([5, 5, 4]) oddAndTen ([5, 5, 4, 1]) false true

A prime number is an integer greater than 1 whose only positive divisors are 1 and the integer itself. The Greek mathematician Eratosthenes developed an algorithm, known as the Sieve of Eratosthenes, for finding all prime numbers less than or equal to a given number n—that is, all primes in the range 2 through n. Consider the list of numbers from 2 through n. Two is the first prime number, but the multiples of 2 (4, 6, 8,...) are not, and so they are crossed out in the list. Hie first number after 2 that was not crossed out is 3, the next prime. We then cross out from the list all higher multiples of 3 (6, 9, 12,…). The next number not crossed out is 5, the next prime, and so we cross out all higher multiples of 5 (10, 15, 20,…). We repeat this procedure until we reach the first number in the list that has not been crossed out and whose square is greater than n. All the numbers that remain in the list are the primes from 2 through n. Write a program that uses this sieve method and an…

Given a list of integers, we want to know whether it is possible to choose a subset of some of the integers, such that the integers in the subset adds up to the given sum recursively. We also want that if an integer is chosen to be in the sum, the integer next to it in the list must be skipped and not chosen to be in the sum. Do not use any loops or regular expressions. Test cases: skipSum([2, 5, 10, 6], 12) true skipSum([2, 5, 10, 6], 7) false skipSum([2, 5, 10, 6], 16) false Given code: public static boolean skipSum (List list, int sum) { // call your recursive helper method return skipSumHelper (list, e, sum); 1. 2. 3. 4.