An insertion sort solution

gistfile1

class Array
  def insertion_sort(list = self)
    sorted = [self.delete_at(0)]
    self.each_with_index do |i, p|
      if i < sorted.last
        sorted.each_with_index do |j, k|
          if sorted[k] >= i
            already_sorted = sorted.slice(0, k - 1)
            to_shift = sorted.slice(k + 1, sorted.size)
            sorted = already_sorted + [i] + to_shift
            break
          end
        end
      end
    end
    sorted
  end
end