1class InsertionSort
 2  def sort(items)
 3    items.size.times do |n|
 4      j = n
 5      while j >= 0 do
 6        if (items[j] <=> items[j+1]) == 1
 7          items[j], items[j+1] = items[j+1], items[j]
 8        end
 9        j-=1
10      end
11    end
12    items
13  end
14end