Trouble with partition algorithm in quicksort with middle pivot

Question

I am trying to implement quicksort using the middle element in the array/subarray as a pivot, rather than the leftmost or rightmost element.

In my mind, the way quick