Chapter 15, Problem 20RQE

Program Plan Intro

Algorithm:

• Start a program.
• Declare a class named “Sorter”.
  • Declare a required member variables and pure virtual function.
  • In public, define the member function “set_Array()”.
    • Inside the function set the array and size of an array.
  • Define the “sort” function.
    • Inside the function, call the “sort()” function with an argument size.
• Define the “sort” function.
  • If the size is less than 1, the condition will ended.
  • Find the position of largest value in array and put it at the end of the array.
    • Use the “compare ()” function for sorting the given array.
    • Swap a pair of array elements.
    • Decrement the size by 1.
• Define the derived class “Incr_Sorter” from the class “Sorter”.
  • In private, define the pure virtual function “compare()”.
    • If the “x” value is greater than “y” value return true.
• Define the derived class “Decr_Sorter” from the class “Sorter”.
  • In private, define the pure virtual function “compare()”.
    • If the “x” value is less than “y” value return true.
• Inside the “main” function,
  • Create the objects for the classes.
  • Declare and initialize an array of 5 values.
  • Call the “Incr_Sorter” function.
  • Call the “print_Array()” function for displaying the output.
  • Call the “Decr_Sorter” function.
  • Call the “print_Array()” function for displaying the output.
• Define the “print_Array()” function.
  • Display the array.