DSAverse

Sorting Algorithms

Loading Sorting Algorithms...

Sorting Visualization

n = 8 elementscomparing...

Back to Sorting

Quick Sort Visualizer

Watch how Quick Sort uses divide-and-conquer by partitioning around a pivot element to efficiently sort the array.

Time: O(n log n) avg

Space: O(log n)

Stable: No

In-place: Yes

Animation Speed: 1000ms

Fast (500ms)Slow (3000ms)

Progress: Step 1 of 0Level 0 | Phase: start

640

341

252

123

224

115

906

Unsorted

Pivot

Partition Range

Left (≤ pivot)

Right (> pivot)

Pointers

Comparing

Swapping

Sorted

Current Step

Click Play to begin the Quick Sort visualization

Algorithm Details

Best Case:O(n log n)

Average Case:O(n log n)

Worst Case:O(n²)

Space:O(log n)

Stable:No

In-place:Yes

When to Use Quick Sort

Large datasets with good pivot selection
Memory-constrained environments (in-place)
Cache-efficient sorting needed
When worst-case O(n²) is unacceptable
When stability is required

Knowledge Check

Question 1 of 3

What is Quick Sort's average case time complexity?

DSAverse

Sorting Algorithms

Loading Sorting Algorithms...

Sorting Visualization

n = 8 elementscomparing...