I want to do a in-place version of Quicksort program following the Lomuto partitioning method.

Guideline:

Break up each array into sorted sub-arrays.

Always select the last element in the 'sub-array' as a pivot.

Partition the left side and then the right side of the sub-array.

Print out the whole array at the end of every partitioning method.

This should be repeated in each sub-array.

using namespace std;

int main() { // code here }

Partitioning an array The Initial Array, where 13 9 8 21 7 the pivot has been marked m The first two elements are 1 3 9 6 2 71 each compared with the pivot (and they are "swapped" with themself. he next two element 1 3 9 8 2 7 5 are greater th the an pivot so they remain where they are. 2 The 2 is smaller than the pivot, so it is 1 3 7 5 swapped with the first element available. The 7 is larger, so it 1 3 2 8 9 7 5 remains where it is. Finally, the pivot is 1 3 2 9 7 swapped into the correct location. The amay has now been partitioned, and the index of the pivot can be returned