Chapter 20, Problem 3PC

Program Plan Intro

Quick sort template

Program Plan:

Main.cpp

• Include the required header files.
• Declare the necessary function prototype and constants.
• Define the main () function.
  • Declare the necessary variables.
  • Get the required input from the user.
  • Call the method “quickSort()” to perform the sort operation for the given elements.
  • The sorted values are being displayed to the user using a loop.

Quicksort.h

• Define the template function necessary.
• Define the method definitions that compares and performs sort operation for the contents of the array using quick sort.
• Define the method “quickSort()”,
  • Declare the necessary variables.
  • Condition statement that compares the values present at the beginning and at the end.
  • Call the method “partition()” to partition the list.
  • Call the method “quicksort()” to sort the first and second sub lists.
• Define the method “partition()”,
  • Declare the necessary variables.
  • Calculate the mid value of the list.
  • Call the function to perform necessary swap using “swapVars()”.
  • Use a loop to iterate to validate the values using if condition then perform the necessary swaps by calling the function “swapVars()”.
  • Return the index of the pivot element.
• Define the  method “swapVars()”,
  • Declare the necessary variables.
  • Assign the temporary variable and perform the necessary swap assignment statements as required.