Write a program that implements several sorting algorithms, and use it to demonstrate the comparative performance of the algorithms for a variety of datasets. Please make use of the skeleton program sorting.cpp Download sorting.cpp.

Your submission for this task will consist of the modified program sorting.cpp for Levels 1 and 2, and a PDF document describing your performance profiling for Levels 3 and 4. You should submit both of these files in CodeGrade.

Background

The skeleton program contains a main function for testing the operation of several sort algorithms over various data sizes and dataset organisations. The program understands the following arguments: -i insertion sort -s selection sort (default) -q quicksort -n no sorting -a (already) sorted dataset -v reverse-sorted dataset -r random dataset (default)

X generate a dataset of size X (default size 10000)

So for example, running the program with the arguments -sa 4000 will run selection sort on an automatically generated data set of 4000 numbers that are already sorted in order. Level 1: Basic sorts Implement the selectionSort and insertionSort functions. Note that you can base your code on the sample code used in lectures, although you will need to modify the code solutions in the slides from passing the data using an array and two indexes to passing it using two pointers. The program will check that the final list is sorted correctly.

Level 2: Quicksort Implement the quickSort function. The real work of quicksort happens in the partition operation, so it is probably best to define a separate function to do the partitioning.

I need your help with this please, this is the structure of the code i do not how to implement and i have tried to implement but didn't got the desired output. can you please help me with this and give me some explanation along with code so it will be easy for me to implement with my own thinking.