Ruby Implementation of Insertion Sort

insertion_sort.rb

def insertion_sort(array)
  return array if array.size <= 1
  (array.size).times do |j|
    while j > 0
      if array[j - 1] > array[j]
        array[j - 1], array[j] = array[j], array[j - 1]
      else
        break
      end
      
      j -= 1
    end
  end
  
  array
end