1、插入排序 代码如下:seq = [3,4,9,0,2,5,9,7,1]
1.upto(seq.length-1) do |i| if seq[i] < seq xss=removed xss=removed>=0 && tmp<seq[j]) do seq[j+1] = seq[j] j=j-1 end seq[j+1]=tmp endend
seq.each {|num| puts num}
2、冒泡排序 代码如下:seq = [3,4,9,0,2,5,9,7,1,100,99,24,64,18,88,66]
0
