Ruby 冒泡排序
摘要:
arr = [2,5,1,8,7]def getSort(arr) len = arr.length for i in 0...len-1 for j in 0...len-i-1 if arr[j] > arr[j+1] temp = arr[j] arr[j] = arr[j+1] arr[j+1] = temp end end endendgetSort(arr)p arr 阅读全文
posted @ 2012-08-23 16:30 张飞_ 阅读(958) 评论(0) 推荐(0)
浙公网安备 33010602011771号