使用 ruby 实现插入排序算法

seq = [3,4,9,0,2,5,9,7,1]

.upto(seq.length-) do |i|
if seq[i] < seq[i-1]
    tmp = seq[i]
    j = i-
while(j>= && tmp<seq[j]) do
      seq[j+1] = seq[j]
      j=j-
end
    seq[j+1]=tmp
end
end

seq.each {|num| puts num}

seq = [3,4,9,0,2,5,9,7,1,100,99,24,64,18,88,66]

.upto(seq.length-) do |i|
  exchange = false
.upto(seq.length--i-) do|j|
if seq[j]>seq[j+1]
       tmp = seq[j+1]
       seq[j+1] = seq[j]
       seq[j] = tmp
       exchange = true
end
end

if !exchange
break
end
end

seq.each {|num| puts num}