Sign In

Access your saved progress

or

Intermediate 25 min

Interactive Visualization

Watch quick sort work in real-time. The visualizer shows partitioning and recursive sorting.

Quick Sort Visualization

1x
Pseudo Code
1 pivot = array[high]
2 i = low - 1
3 for j = low to high - 1
4 if array[j] < pivot
5 i++
6 swap(array[i], array[j])
7 swap(array[i+1], array[high])
8 return i + 1

What to Observe

As you watch the visualization, notice:

  1. Pivot selection: Pivot is highlighted
  2. Partitioning: Elements are rearranged around pivot
  3. Recursion: Process repeats for sub-arrays
  4. Base case: Single elements are already sorted
  5. Final result: Array is completely sorted

Understanding the Colors

  • Orange/Yellow: Pivot element
  • Blue/Cyan: Elements being compared
  • Green: Elements in correct position
  • Red: Elements being swapped

Try Different Arrays

The visualizer shows how quick sort:

  • Partitions around pivot
  • Recursively sorts sub-arrays
  • Achieves O(n log n) average performance

What’s Next?

Now that you’ve seen it work, let’s implement quick sort in code.

Progress 57%
Page 4 of 7
← Previous → Next