Quick Sort

In-place Partitioning

Scanning and swapping around the pivot

Step:1 / 118

[0]

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

Speed1x

Size12

Context Info

Recursive Depth0

Active PivotNone

Step Explanation

Entering segment [0, 11] at recursive depth 0.

Partition Algorithm

Pseudocode

1function quickSort(arr, lo, hi):
2  if lo >= hi: return
3  p = partition(arr, lo, hi)
4  quickSort(arr, lo, p-1)
5  quickSort(arr, p+1, hi)

Did you know?

Quick Sort is In-Place, meaning it needs very little extra memory ($O(\log n)$ for stack).
The choice of Pivot is critical – picking a bad pivot (like the min or max) repeatedly leads to $O(n^2)$ time.
It is generally Faster than Merge Sort in practice due to better cache performance and lower constant factors.