Selection Sort Visualizer

Watch how Selection Sort finds the minimum element in each pass and places it in the correct position.

Time: O(n²)

Space: O(1)

Stable: No

In-place: Yes

Animation Speed: 800ms

Fast (200ms)Slow (2000ms)

Progress: Step 1 of 0Pass 0 of 0

640

341

252

123

224

115

906

Unsorted

Current Position

Current Minimum

Comparing

Swapping

Sorted

Click Play to begin the Selection Sort visualization

Best Case:O(n²)

Average Case:O(n²)

Worst Case:O(n²)

Space:O(1)

Stable:No

In-place:Yes

Question 1 of 3

How many swaps does Selection Sort perform in the worst case?

DSAverse

Sorting Algorithms

Loading Sorting Algorithms...

Sorting Visualization

n = 8 elementscomparing...