php常用算法总.docxVIP

按数量级递增排列，常见的时间复杂度有：常数阶O(1),对数阶O(log2n),线性阶O(n),线性对数阶O(nlog2n),平方阶O(n2)，立方阶O(n3)//二分查找O(log2n)function erfen($a,$l,$h,$f){ if($l $h){ return false;} $m = intval(($l+$h)/2); if ($a[$m] == $f){ return $m; }elseif ($f $a[$m]){ return erfen($a, $l, $m-1, $f); }else{ return erfen($a, $m+1, $h, $f); }}$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