// 冒泡排序
function m_sort($arr)
{
$len = count($arr);
for ($i = 0; $i < $len -1; $i++) {//循環對比的輪數
for ($j = 0; $j < $len - $i - 1; $j++) {//當前輪相鄰元素循環對比
if ($arr[$j] > $arr[$j + 1]) {//如果前邊的大于后邊的
$tmp = $arr[$j];//交換數據
$arr[$j] = $arr[$j + 1];
$arr[$j + 1] = $tmp;
}
}
}
return $arr;
}
$arr = [5,2,4,7,9,4,1,6,8,3,2];
echo '<pre>';
$array = m_sort($arr);
$data = array(
array('id' => 1, 'pid' => 0, 'name' => '河北省'),
array('id' => 2, 'pid' => 0, 'name' => '北京市'),
array('id' => 3, 'pid' => 1, 'name' => '邯鄲市'),
array('id' => 4, 'pid' => 2, 'name' => '朝陽區'),
array('id' => 5, 'pid' => 2, 'name' => '通州區'),
array('id' => 6, 'pid' => 4, 'name' => '望京'),
array('id' => 7, 'pid' => 4, 'name' => '酒仙橋'),
array('id' => 8, 'pid' => 3, 'name' => '永年區'),
array('id' => 9, 'pid' => 1, 'name' => '武安市'),
);
//遞歸無限極分類
function getAllChildClass($data, $cid = 0, $keyname='id', $pidname='pid')
{
$cdata = [];
foreach($data as $key => $val)
{
if($val[$pidname] == $cid){
$rs = getAllChildClass($data, $val[$keyname]);
$val['children'] = !empty($rs) ? $rs : [];
$cdata[] = $val;
}
}
return $cdata;
}
$new_array = array();
//獲取文件下所有的文件
function loopDir($dir,&$new_array)
{
$handle = opendir($dir);
while(($file = readdir($handle))!== false ){
if ($file != '.' && $file != '..'){
if (filetype($dir.'/'.$file) != 'dir'){
//echo $dir . '/' . $file.'<br>';
array_push($new_array,$dir . '/' . $file);
}
if (filetype($dir.'/'.$file) == 'dir'){
loopDir($dir.'/'.$file,$new_array);
}
}
}
}
$dir = 'D:\php\phpstudy\phpstudy_pro\WWW';
loopDir($dir,$new_array);