Quick Sort with two pivots (Dual-Pivot)

Quick Sort is a Sorting Algorithm that takes a divide-and-conquer approach. We will be looking at how to do this while selecting two pivots points instead of one.

Contents:

How to Quick SortHow to Partition for two pivot pointsTime & Space ComplexityExtra

Pre-requisites:

Quick SortTime and Space complexity of Quick SortParallel Quick SortInterview Questions on Quick SortQuick Sort

When performing Quick Sort their are two parts to it, first part of the Algorithm calls the second part ...