冒泡算法
摘要：
C#static void Bubble(){ int temp = 0; List list = new List() { 72, 54, 59, 30, 31, 78, 2, 77, 82, 72 }; for (int i = list.Count; i > 1; i--) { for (int j = 0; j list[j + 1]) { temp = list[j]; list[j] = list[j + 1]; list[j + 1] = temp; } } }}javascriptfunction MaoPaoSort() { var temp; var arr ... 阅读全文
posted @ 2014-02-07 17:23 itjeff 阅读(189) 评论(0) 推荐(0) 编辑
