Selection Sort

sorting

Click Generate New or press Play

Step 1 / 1

Ready

Speed

Divides the array into sorted and unsorted regions, repeatedly finding the minimum from the unsorted region.

Time Complexity

Best

\mathrm{O}\left(n^{2}\right)

Avg

\mathrm{O}\left(n^{2}\right)

Worst

\mathrm{O}\left(n^{2}\right)

Max Operations

Worst-case bound

\frac{n(n-1)}{2}

Used for efficiency calculation in Stats Panel

Space Complexity

Aux

\mathrm{O}\left(1\right)

In-place — only a temp swap variable

Pseudocode

1procedure selectionSort(A: list)

2for i = 0 to n-1 do

3minIdx = i

4for j = i+1 to n do

5if A[j] < A[minIdx] then

6minIdx = j

7if minIdx != i then swap(A[i], A[minIdx])

8end for