Chapter 23, Problem 23.3PE

Program Plan Intro

Generic quick sort

Program Plan:

• Import the required packages.
• Create a class “Sorting”:
  • Method to sort the numbers gets defined.
  • Call the method quick sort that implements the comparable interface.
  • Method to sort the string given.
• Define the main method
  • Initialize the list that needs to be sorted.
  • Call the quick sort.
  • Display the sorted list.
  • Initialize list that contain strings.
  • Call the method quick sort.
  • Display the sorted list.
• Define the method “quickSort()”
  • Condition to validate the first element and last element.
  • Partition the list .
  • Sort the list by calling the method quick sort.
• Define the method “partition()”
  • Perform swap operation by comparing the list.
  • Loop that iterates to validate the first and last elements of the list.
  • Return the begin and last value after validating.