Chapter 9, Problem 13PP

Program Plan Intro

Implementation of “PrimeSequence” class

Program plan:

• In a file “Sequence .java”,
  • Create a package.
  • Create an interface “Sequence”,
    • Declare the method “next()”.
• In a file “PrimeSequence .java”,
  • Create a package.
  • Create a class “PrimeSequence”,
    • Initialize the variable to “2”.
    • Use naïve algorithm to produce the next value in the sequence of prime using the following “next()” method.
    • Define the method “next()”,
      • Initialize the Boolean variable to false.
      • Execute he following,
        • Declare the loop variable.
        • Create loop to check each number less than the “n” for divisibility of “n”.
        • Check whether the value is same as “n”,
        • • If it is true, set the Boolean variable to true.
        • Increment the counter variable.
      • End the loop while the condition is false.
      • Return the value.
• In a file “SequenceDemo.java”,
  • Create a package.
  • Create a class “SequenceDemo”,
    • Define the method “main()”
      • Create object for “PrimeSequence”.
      • Execute lop for “100” times,
        • Print the prime number obtained by “next()”.