Divide & Conquer: Quick Sort

The Pivot Strategy (QuickSort)

QuickSort is a high-speed "Divide and Conquer" algorithm. It picks a "Pivot" point and splits the world into two sides: those smaller than the pivot and those larger. By doing this recursively, the array is sorted at lightning speed.

The Assignment

Your mission is to implement the recursive QuickSort protocol. Your function receives data.

1. Use a helper function for the partition logic (Lomuto Partition).
2. Choose the last element as the pivot.
3. Partition the array such that all smaller elements move to the left of the pivot.
4. Recursively sort the left and right halves.
5. Print the final sorted result (space-separated).