}
$a
=
array
(1,12,23,67,88,100);
var_dump(erfen(
$a
,0,5,1));
//遍历树 O(log2n)
function
bianli(
$p
){
$a
=
array
();
foreach
(
glob
(
$p
.'/*')
as
$f
){
if
(
is_dir
(
$f
)){
$a
=
array_merge
(
$a
,bianli(
$f
));
}
else
{
$a
[] =
$f
;
}
}
return
$a
;
}
//阶乘 O(log2n)
function
jc(
$n
){
if
(
$n
<=1){
return
1;
}
else
{