Rosetta Code

Bubble sort

Sort an array of integers using the bubble sort algorithm.

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/bubble_sort.vibe
type RunResult = {
  already: array<int>,
  reversed: array<int>,
  single: array<int>,
  sorted: array<int>
}

def bubble_sort(arr: array<int>) -> array<int>
  n = arr.length
  swapped = true

  while swapped
    swapped = false
    i = 1
    while i < n
      if arr.fetch(i - 1) > arr.fetch(i)
        temp = arr.fetch(i - 1)
        arr[i - 1] = arr.fetch(i)
        arr[i] = temp
        swapped = true
      end
      i = i + 1
    end
    n = n - 1
  end

  arr
end

def run -> RunResult
  {
    sorted: bubble_sort([64, 34, 25, 12, 22, 11, 90]),
    already: bubble_sort([1, 2, 3, 4, 5]),
    reversed: bubble_sort([5, 4, 3, 2, 1]),
    single: bubble_sort([42])
  }
end

Output

Click Run example to see the result.

Code checks

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