Hello I'm a bit confused about this assignment. Needs to be done in c++, any help is greatly appreciated. Comment if you

[answerhappygod]

Hello I'm a bit confused about this assignment. Needs to be done
in c++, any help is greatly appreciated.
Comment if you need more info and I can can see what I can find,
thanks in advance.
Function Templates
QuickSort Template
Create a template version of the QuickSort algorithm that
will work with any data type. Demonstrate the template with a
driver function (main) to test it.
// This program demonstrates the QuickSort Algorithm.
#include <iostream>
using namespace std;
// Function prototypes
void quickSort(int [], int, int);
int partition(int [], int, int);
void swap(int &, int &);
int main()
{
const int SIZE = 10; // Array size
int count; // Loop counter
int array[SIZE] = {7, 3, 9, 2, 0, 1, 8, 4, 6, 5};
// Display the array contents.
for (count = 0; count < SIZE; count++)
cout << array[count] << " ";
cout << endl;

// Sort the array.
quickSort(array, 0, SIZE - 1);

// Display the array contents.
for (count = 0; count < SIZE; count++)
cout << array[count] << " ";
cout << endl;
return 0;
}
//************************************************
// quickSort uses the quicksort algorithm to *
// sort set, from set[start] through set[end]. *
//************************************************
void quickSort(int set[], int start, int end)
{
int pivotPoint;
if (start < end)
{
// Get the pivot point.
pivotPoint = partition(set, start, end);
// Sort the first sub list.
quickSort(set, start, pivotPoint - 1);
// Sort the second sub list.
quickSort(set, pivotPoint + 1, end);
}
}
//**********************************************************
// partition selects the value in the middle of the *
// array set as the pivot. The list is rearranged so *
// all the values less than the pivot are on its left *
// and all the values greater than pivot are on its right. *
//**********************************************************
int partition(int set[], int start, int end)
{
int pivotValue, pivotIndex, mid;
mid = (start + end) / 2;
swap(set[start], set[mid]);
pivotIndex = start;
pivotValue = set[start];
for (int scan = start + 1; scan <= end; scan++)
{
if (set[scan] < pivotValue)
{
pivotIndex++;
swap(set[pivotIndex], set[scan]);
}
}
swap(set[start], set[pivotIndex]);
return pivotIndex;
}
//**********************************************
// swap simply exchanges the contents of *
// value1 and value2. *
//**********************************************
void swap(int &value1, int &value2)
{
int temp = value1;
value1 = value2;
value2 = temp;
}
For this programming segment of this assignment you may choose
to (a) create a separate header file "quicksort.h" which should
contain the three function definitions (quickSort, partition and
swap) along with the inclusion of a generic function template
<class T> above each function heading as well as the use of a
type parameter to the function to specify a generic data type or
(b) update the source code provided above to include the function
template with necessary updates to the function
parameters.
With the inclusion of the the function template you may test it
with the following function call in main:
Turn in the entire program (single file 8d.cpp or with multiple
files quicksort.h and 8d.cpp)