The lab is to develop a C++ program that will implement the Quicksort algorithm.

You need to write

a) Quicksort function that will take three inputs: array A, integer variables first and last which represent first and last index of the array.

The algorithm for QuickSort is as follows

Check if first < last, then

call the Partition function and store the value in an integer variable mid.

Then recursively call QuickSort twice, using the following function calls.

QuickSort(A, first, mid-1);

QuickSort(A, mid+1, last);

b) Swap function

Swap function takes three inputs, array A, index i and J and then swaps the two values stored in A[I] and A[J] using a temp variable.

c) call QuickSort as

QuickSort(A, 1, N);