Chapter 14, Problem 15E

Program Plan Intro

Sorted stack of integers

Program plan:

• Import necessary packages.
• Create a class “SortedStack”,
  • Define the method “isSorted ()” that accepts stack of integers,
    • Check whether the stack size is less than “2”,
      • If it is true, return “true”.
    • Set the Boolean value to “true”.
    • Assign the top of stack to the variable “previous”.
    • Create temporary stack.
    • Insert the top of original stack into temporary stack.
    • Execute till original stack becomes empty,
      • Assign the recent top of stack element.
      • Insert the recent top of original stack into the temporary stack.
      • Check whether the previous top of stack is greater than the recent top of stack,
        • Set the Boolean value to “false”.
        • • Set the recent top of stack as previous top of stack.
    • Execute till new stack becomes empty,
      • Restore the elements into the original stack.
    • Return the Boolean value.
  • Define the method “main()”,
    • Construct “Stack” object.
    • Add integers into the stack.
    • Print the stack of integers.
    • Assign the Boolean value returned from the method “isSorted()” when calling with stack as parameter.
    • Check whether the returned Boolean value is “true”,
      • If it is true, print the message as sorted.
    • Otherwise, print the message as not in sorted order.