Chapter 14, Problem 3PC

Program Plan Intro

QuickSort template

Program Plan:

“main.cpp”

• Include the required header files.
• Define the main () function.
  • Declare and define the necessary variables using “for” loop.
  • Prompt and get “10” array elements 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 “for” loop.

“Quicksort.h”

• Define the necessary template function.
• Define the method definition that compare and performs sort operation for the contents of the array using quick sort.
• Define the  method “swapVars ()” with two arguments,
  • Assign the temporary variable and perform the necessary swap assignment statements as required.
• Define the method “partition()” with three arguments,
  • Declare the necessary variables.
  • Calculate the “mid” value from the list of elements.
  • Call the function “swapVars ()” to perform necessary swap operations.
  • Use “for” loop to iterate and 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 “quicksort ()”,
  • Declare the variable named “pivotpt”.
  • 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.