Selection Sort Visualizer

Current line Previous line Follow code Show previous

selectionSort.java

j: - k: - min: -

for (int j = 0; j < n - 1; j++) { int minIndex = j; for (int k = j + 1; k < n; k++) { if (elements[k] < elements[minIndex]) { minIndex = k; } } int temp = elements[j]; elements[j] = elements[minIndex]; elements[minIndex] = temp; } // done ✅

Array Size

Range (Min, Max)

Custom (e.g. 5, 2, 9)

Speed (ms)

j (Current target)

k (Scanning)

minIndex (Smallest found)

Sorted portion

Welcome! Press Step or Play to begin the sorting process.

j: -

k: -

min: -

Comparisons: 0

Swaps: 0

Passes: 0