Big Java Late Objects
Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 13, Problem 5PP
Program Plan Intro

Permutation of word

Program plan:

Filename: “NumberPermutationIterator.java”

This program file is used to define a class “NumberPermutationIterator”. In the code,

  • Import the required packages.
  • Define a class “NumberPermutationIterator”.
    • Create an integer array “a”.
    • Define the “NumberPermutationIterator()” constructor.
      • Set the size of the array as “n”.
      • Iterate a “for” loop up to “i<n”.
        • Set the value of “i” to array.
    • Define the “nextPermutation()” method.
      • If the length of the array is less than or equal to 1,
        • Return “a”.
      • Iterate a “for” loop,
        • If element at “i-1” is less than element at “i”.
          • Set “length-1” of the array “a”.
          • Iterate a “while” loop,
            • Decrement the value of “j” by 1.
          • Call the method “swap()”.
          • Call the method “reverse()”.
          • Return the value of “a”.
      • Return the value of “a”.
    • Define the “hasMorePermutation()” method.
      • If the length of the array is less than or equal to 1,
        • Return “false”.
      • Iterate a “for” loop,
        • If element at “i-1” is less than element at “i”.
          • Return “true”.
      • Return “false”.
    • Define the “swap()” method.
      • Swap the elements of the array
    • Define the “reverse()” method.
      • While “i” less than “j”,
        • Call the method “swap()”.
        • Increment the value of “i” by 1.
        • Decrement the value of “j” by 1.

Filename: “PermutationIterator.java”

This program file is used to define a class “PermutationIteratorDemo”. In the code,

  • Import the required packages.
  • Define a class “PermutationIteratorDemo”.
    • Define the “main” method.
      • Define the object “iter” of “PermutationIterator”.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.

Blurred answer
Students have asked these similar questions
Using the notation

you can select multipy options
For each of the following, decide whether the claim is True or False and select the True ones: Suppose we discover that the 3SAT can be solved in worst-case cubic time. Then it would mean that all problems in NP can also be solved in cubic time. If a problem can be solved using Dynamic Programming, then it is not NP-complete. Suppose X and Y are two NP-complete problems. Then, there must be a polynomial-time reduction from X to Y and also one from Y to X.
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education