ruby實(shí)現(xiàn)的插入排序和冒泡排序算法

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

seq.each {|num| puts num}

0.upto(seq.length-1) do |i|
  exchange = false
   0.upto(seq.length-1-i-1) 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}