Duplicate: https://github.com/miry/algs1/blob/master/lib/insert_sort.rb

insert_sort.rb

def insertionSort(ar)
  j = 1
  while j < ar.size
    i = j - 1
    key = ar[j]
    while i >= 0 && key < ar[i]
      ar[i+1]=ar[i] 
      puts ar.join(" ")
      i -= 1
    end
    if ar[j] != key
      ar[ i + 1 ] = key 
      puts ar.join(" ")
    end
    j += 1
  end
end



# Tail starts here
_ar_cnt = gets.to_i
_ar = gets.split(" ")[0.._ar_cnt].map!(&:to_i)

insertionSort(_ar)