Selection Sort Visualization

Repeatedly finds the minimum element from the unsorted part and puts it at the beginning.

Step: 0 / -1

Speed

1for i = 0 to n-1

2 min = i

3 for j = i+1 to n

4 if arr[j] < arr[min]

5 min = j

6 if min != i

7 swap(arr[i], arr[min])

Best CaseO(n²)

Average CaseO(n²)

Worst CaseO(n²)