To determine the minimum number of swaps performed during the Quicksort algorithm, we first need to partition the array using the last element (100) as the pivot. Then, we move all elements smaller than the pivot to the left of it and all elements greater than the pivot to the right of it.
Given the array:
\[ \text{[60, 70, 80, 90, 100]} \]
Using the last element (100) as the pivot, after partitioning, the array may look like this:
\[ \text{[60, 70, 80, 90, 100]} \]
Since the pivot element (100) is already at its correct position in the sorted array, there are no swaps needed for this partitioning step.
Next, we recursively apply the same process to the left and right subarrays. For the left subarray \([60, 70, 80, 90]\), the pivot is 90, and after partitioning, the array may remain the same as the pivot is already at its correct position.
For the right subarray, there is only one element (100), which is already sorted.
Therefore, no swaps are needed in this case.
So, the minimum number of swaps performed during this Quicksort is 0.
