源码网商城,靠谱的源码在线交易网站 我的订单 购物车 帮助

源码网商城

ruby实现的插入排序和冒泡排序算法

  • 时间:2021-11-05 02:18 编辑: 来源: 阅读:
  • 扫一扫,手机访问
摘要:ruby实现的插入排序和冒泡排序算法
[b]1、插入排序 [/b]
[u]复制代码[/u] 代码如下:
seq = [3,4,9,0,2,5,9,7,1] 1.upto(seq.length-1) do |i|   if seq[i] < seq[i-1]     tmp = seq[i]     j = i-1     while(j>=0 && tmp<seq[j]) do       seq[j+1] = seq[j]       j=j-1     end     seq[j+1]=tmp   end end seq.each {|num| puts num}
[b]2、冒泡排序 [/b]
[u]复制代码[/u] 代码如下:
seq = [3,4,9,0,2,5,9,7,1,100,99,24,64,18,88,66] 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}
  • 全部评论(0)
联系客服
客服电话:
400-000-3129
微信版

扫一扫进微信版
返回顶部