Combine QuickSort and Median selection algorithm

Question

I want to modify QuickSort (in Java) so that every time Partition is called, the median of the proportioned array is used as the pivot.

I have a median selection algorit

Answer 1

The standard way to get the median is to sort the data. And you want to sort the data by partitioning on the median. This seems very chicken and egg to me.

Could you elaborate on why you want to partition/pivot on the median?