50
QuickSort (3-Way Partition)
Efficient divide-and-conquer algorithm with 3-way partitioning to handle duplicates optimally. Used in many standard libraries.
Time Complexity
Best:
O(n log n)Average:
O(n log n)Worst:
O(n²)Space Complexity
O(log n)Properties
In-Place
Color Legend
Default
Comparing
Swapping
Sorted
Pivot
Setting Value