Back to Sorting Algorithms

Quick Sort Visualizer

Divide & Conquer • Partitioning • O(n log n)

Comparing
Pivot
Sorted
Unsorted

Recursion Call StackDepth: 0 / 0

Recursion tree will appear during sorting

Max Recursion Depth:

Controls

550
SlowMediumFast
Visualization Options

Statistics

Comparisons
0
Swaps
0
Array Accesses
0
Depth
0/0

Time Complexity

Best Case:O(n log n)
Average:O(n log n)
Worst Case:O(n²)
Space:O(log n)

Properties

Stable:No
In-place:Yes
Method:Partitioning
Type:Comparison