#!/bin/ruby

t=Array.new
for i in 0..15
  t[i]=rand(1..200)
end
print "#{t}\n"

class InsertSort
  def self.sort t
    before_last = t.size - 2
    i = 0
    for i in i..before_last
      k=i
      saved=t[k+1]
      while k>=0 && t[k]>saved
        t[k+1]=t[k]
        k=k-1
      end
      t[k+1]=saved
    end
  end
end
InsertSort.sort t
print "\n#{t}"