Manjusaka

for($i=0;$i for($j=0;$jif($a[$j]>$a[$j+1]){$temp=$a[$j];$a[$j]=$a[$j+1];$a[$j+1]=$temp;}}}这是冒泡排序算法i控制循环的趟数，j控制每趟内部循环比较的次数-------------------------------------------------------------

function subtree($arr,$id=0,$lev=1) {    $subs = array(); // 子孙数组    foreach($arr as $v) {        if($v['pid'] == $id) {            $v['lev'] = $lev;            $subs[] = $v; // 举例说找到array('