无限极分类

<?php/*** 无限极分类* @param $list array 要分类的数组* @param $parent_id int 当前分类的父id* @param $deep int当前调用递归的深度* @return array 返回按层级排序好的数组*/function tree(&$list,$parent_id,$deep){static $tree = array();foreach($list as $v){if($v['parent_id'] == $parent_id){$v['deep'] = $deep;$tree[] = $v;tree($list,$v['cat_id'],$deep+1);}}return $tree;}$result = tree($list,0,0); // 无限极分类echo '<pre>';foreach($result as $v){echo '|' . str_repeat('----',$v['deep']);echo $v['cat_name'];echo '<br />';}?>