php 无限级分类 递归+sort排序 和 非递归

1 先总结非递归

数据表：

id	name	pid	path
1	php	0	0
2	mysql	0	0
3	linux	0	0
4	php-基本语法	1	0-1
5	linux-磁盘分区	3	0-3

<?php

$navArr = [
  [
      'name'=>'php',
      'id'=>1,
      'pid'=>0,
      'path'=>'0',
      'sort'=>'2',

  ],
    [
        'name'=>'php-基础',
        'id'=>2,
        'pid'=>1,
        'path'=>'0-1',
        'sort'=>'2',

    ],
    [
        'name'=>'php-面向对象',
        'id'=>5,
        'pid'=>1,
        'path'=>'0-1',
        'sort'=>'1',

    ],
    [
        'name'=>'php-面向对象-属性',
        'id'=>6,
        'pid'=>5,
        'path'=>'0-1-5',
        'sort'=>'2',

    ],
    [
        'name'=>'php-面向对象-访问权限',
        'id'=>7,
        'pid'=>5,
        'path'=>'0-1-5',
        'sort'=>'1',

    ],
    [
        'name'=>'服务端',
        'id'=>3,
        'pid'=>0,
        'path'=>'0',
        'sort'=>'3',

    ],
    [
        'name'=>'mysql',
        'id'=>4,
        'pid'=>0,
        'path'=>'0',
        'sort'=>'1',

    ],
    [
        'name'=>'linux',
        'id'=>5,
        'pid'=>3,
        'path'=>'0-3',
        'sort'=>'3',

    ],
];

foreach($navArr as $k => &$item){
    $num = substr_count($item['path'],'-');
    $pre = $sortPath = '';
    if($num >0)
    {
        $tree = '|'.str_repeat(' -- ',$num).$item['name'];
    }else{
        $tree = $item['name'];
        $sortPath = $item['sort'];
    }
    $item['tree'] = $tree;
    $arr[] = $item['path'].'-'.$item['id'];
}

array_multisort($arr,SORT_STRING,$navArr);

foreach($navArr as $item2)
{
    echo $item2['tree'].'<br/>';
}

 此无限级分类没有处理 分类排序有效，以后更改。

2 递归+排序

<?php
/**
 * Created by PhpStorm.
 * User: Administrator
 * Date: 2018/12/21
 * Time: 19:44
 */

$navList = [
    [
        'id'=>1,
        'name'=>'php',
        'pid'=>0,
        'sort'=>3,
    ],
    [
        'id'=>2,
        'name'=>'mysql',
        'pid'=>0,
        'sort'=>2,
    ],
    [
        'id'=>3,
        'name'=>'linux',
        'pid'=>0,
        'sort'=>1,
    ],
    [
        'id'=>4,
        'name'=>'javascript',
        'pid'=>0,
        'sort'=>0,
    ],
    [
        'id'=>5,
        'name'=>'php-类型',
        'pid'=>1,
        'sort'=>3,
    ],
    [
        'id'=>9,
        'name'=>'php-类型-布尔',
        'pid'=>5,
        'sort'=>3,
    ],
    [
        'id'=>6,
        'name'=>'php-变量',
        'pid'=>1,
        'sort'=>2,
    ],
    [
        'id'=>7,
        'name'=>'php-常量',
        'pid'=>1,
        'sort'=>4,
    ],
    [
        'id'=>8,
        'name'=>'linux-磁盘分区',
        'pid'=>3,
        'sort'=>5,
    ],
];
$arr = getTree(0);
v($arr);
function getTree($pid=0,$level=1)
{
    global $navList;
    $childs = getChild($navList,$pid,$level);
    array_multisort(array_column($childs,'sort'),SORT_NUMERIC,$childs);
    foreach($childs as $key => $navItem)
    {

        $resChild = getTree($navItem['id'],$level+1);
        if(null != $resChild)
        {
            $childs[$key]['child'] = $resChild;
        }

    }
    return $childs;
}

function getChild(&$arr,$id,$lev)
{
    $child = [];
    foreach($arr as $k => $value)
    {

        if($value['pid'] == $id)
        {
            $value['level'] = $lev;
            $child[] = $value;
        }
    }
    return $child;
}

function v($data)
{
    echo '<pre>';
    var_dump($data);exit;
}