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.