Dual Pivot Quick Sort uses two pivots to partition the array into three parts, improving performance compared to classic Quick Sort in many practical scenarios.
Paradigm
Divide and Conquer
Author
Vladimir Yaroslavskiy
Tier
Time Complexity
Best
Avg
Worst
Space
O(log n)
Properties