In the Quick Sort algorithm, the partitioning step is crucial for correctly sorting the array. Given the following array:

array = [9, 3, 8, 4, 7, 5, 6, 2]

If the pivot element is chosen as the last element (in this case, 2), what will the array look like after the first partitioning step? Explain how the partitioning works and what the array should look like after this step.

I attempted to implement the partition step of the Quick Sort algorithm with a pivot element chosen as the last element of the array. My goal was to reorder the array such that all elements less than the pivot are on its left, and all elements greater are on its right. I expected the array to be split into two parts based on this condition, with the pivot element placed in its correct position after the first partition. However, I’m unsure if the elements are correctly positioned after the partitioning process.

For example, with the array [9, 3, 8, 4, 7, 5, 6, 2] and pivot 2, I expected the array to look like [2, 3, 8, 4, 7, 5, 6, 9] after partitioning, but I need to confirm if this is the correct result and understand the reasoning behind it.