Rosetta Code

Selection sort

Sort an array by repeatedly selecting the minimum element from the unsorted portion.

Edit the source, then Run. Checks start after your first Run. Ctrl/⌘ + Enter runs; Tab indents. Preview services use sample data and never contact a real service.

Sourcerosettacode/popular/selection_sort.vibe
def selection_sort(arr: array<int>) -> array<int>
  i = 0
  while i < arr.length - 1
    min_idx = i
    j = i + 1
    while j < arr.length
      if arr.fetch(j) < arr.fetch(min_idx)
        min_idx = j
      end
      j = j + 1
    end

    if min_idx != i
      temp = arr.fetch(i)
      arr[i] = arr.fetch(min_idx)
      arr[min_idx] = temp
    end

    i = i + 1
  end

  arr
end

def run -> { already: array<int>, reversed: array<int>, sorted: array<int> }
  {
    sorted: selection_sort([64, 25, 12, 22, 11]),
    already: selection_sort([1, 2, 3, 4, 5]),
    reversed: selection_sort([5, 4, 3, 2, 1])
  }
end

Output

Click Run example to see the result.

Code checks

Run once to load the checker. Your code stays in this browser.