Different sorting algorithm will be discussed in the lecutres. The task in this worksheet is to write a funtions based on the Quicksort algorithm.
When sorting an array of objects some objects might swap places. This can by very expensive in terms of time and space, as each swap requires to copy an object. We have seen in the previous part of the module that this could potential be computationally expensive (deep copy).
The function that you should implement takes an array of a template class as pass-by-reference. Instead of sorting this array it returns a new array of int. In this new array the first number is the index of the smallest object in the original array, the next number is the index of the 2nd smallest object in the original array and so on.
Example, for parameter ["michael", "sam", "chris", "tom", "anna", "nick"]
the function should return [4, 2, 0, 5, 1, 3]
The function declaration is
template int * index(const T & array,int size)
Your function should be based on the quicksort algorithm. The given array of objects should not be altered. Hint: You might want to consider to write an additional function that can be recursively called.
A test program is provided . To compile the program you can use
#include
#include"assessment3.cpp"
#include
#include
#include
using namespace std;
int main() {
int size = 10;
int *data=new int[size];
for(int i=0;i < size;i++)
data[i]=rand()% 1000;
cout << endl<<"unsorted"<
for(int i=0;i
cout<
int * indexA = index(data,size);
cout<
for(int i=0;i
cout<
cout << endl;
for(int i=0;i
cout<
cout << endl;
delete [] data;
delete [] indexA;
return 0;
}