Implement Insertion Sort in Ruby

insertion_sort.rb

# Algorithms: https://www.geeksforgeeks.org/insertion-sort/
  def insertion_sort(array)
    (array.length).times do |j|

      while j > 0
        break if array[j - 1] < array[j]

        array[j], array[j - 1] = array[j - 1], array[j]
        j -= 1
      end
    end
    array
  end

puts '------------------------------INSERTION SORT O(n^2)--------------------------'
print insertion_sort([3,7,8,4,10,16,2,1,12])