Decide the median component is pivot. That is an excellent technique regarding time complexity as we can find median in linear time as well as partition purpose will constantly divide the input array into two halves. But it's small on normal as median obtaining has large constants.A far more optimized implementation of QuickSort is Hoare's partitio