php的两种好用的无限级分类方法

function sort($arr,$cid=0,$list){
foreach($arr as $
4000
k=>$v){
if($v['pid']==$cid){
$list[$k]=array('name'=>$v['name'],'cid'=>$v['cid'],'c'=>array());
$list[$k]['c']=$this->sort($arr,$v['cid'],$list[$k]['c']);
}
}
return $list;
}

public function sort($arr,$pid=0,$level=0,$h='|---->'){
$tree=array();
foreach($arr as $k=>$v){
if($v['pid']==$pid){
$v['level']=$level+1;
$v['h']=str_repeat($h,$level);
$tree[]=$v;
$tree=array_merge($tree,self::sort($arr,$v['cid'],$v['level'],$h));
}
}
return $tree;
}