Bubble sort simple sorting algorithm

bubble sort.rb

def bubble_sort(array)
  n =  array.length
  loop do
    swapped = false
    (n-1).times do |i|
      # if the item that comes first in the array is bigger than that comes next
      # then resort it
      if array[i] > array[i+1]
        array[i], array[i+1] = array[i+1], array[i]
        swapped = true
      end
    end
    break unless swapped
  end
  array
end

t = Time.now
ar = (1..999).to_a.reverse
p bubble_sort(ar)
puts "Took #{Time.now - t} seconds"