Selection Sort

O(n²)

Colour Guide

Current Minimum Found

Currently Scanning

Sorted (Fixed)

Comparisons: 0 Swaps: 0

Speed

💡 Each pass finds the smallest unsorted element and places it in its final position. Only n-1 swaps ever happen!

Input

Max 16 elements.

Pseudocode

for i = 0 to n-2: minIdx = i for j = i+1 to n-1: if arr[j] < arr[minIdx]: minIdx = j swap arr[i] and arr[minIdx]

Step Log

Complexity

Best Case	O(n²)
Worst Case	O(n²)
Space	O(1)