摘要: 1.冒泡排序法 var arr = [1,4,54,6,2,3,19] var medium = null; for (var j = 0; j <= arr.length-1; j++) { var flag = true; for (var i = 0; i <= arr.length-1-j; 阅读全文
posted @ 2021-08-04 15:02 BenBonBen 阅读(119) 评论(0) 推荐(0) 编辑