递归运算

public function Show()

{

//调用方法

$arr = $this->index->GetAll();

// p($arr);die;

//递归调用  处理数组

$data = $this->GetLevel($arr,0,0);

//发送数据

$this->load->vars('arr',$data);

$this->load->view('show.html');

}

/**

*无限极分类获取层级数据

*@access public

*@param array

*@param parentid

*@param level

*@return array

*/

public function GetLevel($arr,$p_id,$level)

{

//定义全局变量

static $data = array();

foreach($arr as $k=>$v)

{

if($v['parent_id'] ==$p_id)

{

$v['level'] = $level;

$data[] = $v;

$this->GetLevel($arr,$v['id'],$level+1);

}

}

return $data;

}

//html

<p>分类<select name="parent_id">

<opti>

<?php

foreach($arr as $k=>$v){

?>

<opti>

<?=str_repeat('----', $v['level']).$v['uname']?>

</option>

<?php}?>

</select></p>