Selection Sort

comparisonin-placeunstable

Press play to start

1function selectionSort(arr: number[]): number[] {
for (let i = 0; i < arr.length - 1; i++) {
  let minIdx = i
  for (let j = i + 1; j < arr.length; j++) {
    if (arr[j] < arr[minIdx]) {
      minIdx = j
    }
  }
  if (minIdx !== i)
    [arr[i], arr[minIdx]] = [arr[minIdx], arr[i]]
}
return arr
13}

Step 1/0

Custom array:

Complexity

Best:O(n²)
Average:O(n²)
Worst:O(n²)
Space:O(1)

Description

Divides the array into sorted and unsorted regions. Repeatedly finds the minimum element from the unsorted region and places it at the beginning.

When to use

Simple to implement. Use for small arrays where write operations are costly (minimizes swaps). Not suitable for large datasets.