2019年1月20日
PHP冒泡排序
摘要： $a = [5,4,3,2,1,33,44,12,32,0,12,3,211,33,212]; $n = count($a); for($i=0;$i$a[$j+1]){ $t = $a[$j+1]; $a[$j+1] = $a[$j]; $a[$j]=$t; } } } echo ""; for(... 阅读全文
posted @ 2019-01-20 08:30 王默默 阅读(226) 评论(0) 推荐(0) 编辑