For this assignment you need to perform the following tasks. (C++)

1. Write a function called swapListValues(). This functions takes an array of integers as its rst parameter, and two indexes (the left and right indexes). This function does not return a value explicitly. Recall arrays are passed by reference. As the name implies, the two values in the array at the indicated left and right indexes are to be swapped, and since the array is passed by reference, after returning they will be swapped for the caller of this function. 2. Write a function called findAndSwapPivot(). This function takes the same 3 parameters, an array of integers, and two indexes indicating the left and right sides of a sub-portion of the list. The function should nd the value in the middle of the left and right ends, which will be chosen as the pivot. The function should use the previous swapListValues() function to swap the chosen pivot value to the end of the list of integers. This function returns a value. This is dierent from how the textbook implements the nd pivot function. Our function should return the actual pivot value that was chosen (not the pivotIndex, which we know should be the last index of the sub-list after calling this function).

3. Write a function called partitionList(). This will implement the algorithm described preciously. This functions takes the 3 same parameters for the previous functions, an integer array, and left and right indexes for the sub-portion of the list we are currently partitioning. In addition, this function takes a fourth parameter, the pivot value). This function should make use of the swapListValues() function dened previously when swapping values in-place in the list of integers. When this function is called, the pivot has been swapped to the end of the sub-portion of the list, so the right index will be one less than this. This function needs to correctly return the index, described as k above, where the pivot value should actually go. At the end, the location where the left search and right search meet will be this index, the nal location found for the pivot value.

4. Finally write a function called quickSort() using the described algorithm above. This function will use all of the 3 previous functions to do its work. If implemented correctly, there is almost nothing to be done in this function besides calling the other 3 functions, and recursively calling itself (except to check for the base case of your recursion).

___________________________________________________________________________________________________________________________________

Below is the link to the main template which u dont need to change.

https://docs.google.com/document/d/1cvEyKNtUTClko96PW__cYly4vN5Lpj2aPyIbc9MvOuU/edit?usp=sharing

______________________________________________________________________________________________________________________________

put the appropriate prototype and functions and implementations below for the following files. CPP and HPP below.

https://docs.google.com/document/d/1PfFrr_jJvfqRkEHFvzvIBW_WulKouI2YRkyq4fk4J4M/edit?usp=sharing

https://docs.google.com/document/d/12BpYX7--6HQ75pCRoU7abweZR9UQV2j7i5Yk7y7hAkY/edit?usp=sharing

Project Classes Debug assg-05-3.cpp QuickSort-2 cpp QuickSort-1.hpp 1 2 author Jane Programmer 3 @cwid 123 45 678 4 @class coSC 2336, Spring 2019 5 @ide Visual Studio Community 2017 6 date January 23, 2019 9 7assg Assignment e5 9description Assignment 85 Quick Sort 10 11 #ifndefOUICKSORT H 12 #define-QUICKSORT H 13 14 function prototypes go here 18 #endif//-QUTCKSORTH. assg-05-3.cpp QuickSort-2.cpp QuickSort-1.hpp 3 cwid 123 45 678 4 5 ide Visual Studio Community 2017 @author Jane Programmer 4 class cosSc 2336, Spring 2019 6 @date January 23, 2019 7 assg Assignment e5 8 9 @description Assignment e5 Quick Sort 10 11 #include "QuickSort.hpp'. 12 13 1 function implementations go here