Common algorithms and time complexity (PHP)

In ascending order of magnitude, common time Complexities include: constant order O (1), logarithm order o (log2n), linear order O (N), linear logarithm order o (nlog2n ), square order O (n2), cubic order o (N3)

// Binary Search 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 ($, $ m + 1, $ H, $ f) ;}$ A = array (88,100,); var_dump (erfen ($ A, 1 )); // traverse the directory 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 ;}// factorial O (log2n) function JC ($ n) {if ($ n <= 1) {return 1 ;}else {return $ N * JC ($ N-1) ;}// quick search for O (N * log2 (N) function kuaisu ($) {$ c = count ($ A); if ($ C <= 1) {return $ A;} $ L = $ r = array (); for ($ I = 1; $ I <$ C; $ I ++) {if ($ A [$ I] <$ A [0]) {$ L [] = $ A [$ I];} else {$ R [] = $ A [$ I] ;}}$ L = kuaisu ($ L ); $ r = kuaisu ($ R); Return array_merge ($ L, array ($ A [0]), $ R) ;}// insert sort O (N * n) function Charu ($ A) {$ c = count ($ A); For ($ I = 1; $ I <$ C; $ I ++) {$ T = $ A [$ I]; for ($ J = $ I; $ j> 0 & $ A [$ J-1]> $ t; $ j --) {$ A [$ J] = $ A [$ J-1];} $ A [$ J] = $ t;} return $ ;} // select the sort O (N * n) function xuanze ($ A) {$ c = count ($ A); For ($ I = 0; $ I <$ C; $ I ++) {for ($ J = $ I + 1; $ j <$ C; $ J ++) {if ($ A [$ I]> $ A [$ J]) {$ T = $ A [$ J]; $ A [$ J] = $ A [$ I]; $ A [$ I] = $ t ;}} return $ ;} // bubble sort O (N * n) function maopao ($ A) {$ c = count ($ A); For ($ I = 0; $ I <$ C; $ I ++) {for ($ J = $ C-1; $ j> $ I; $ j --) {if ($ A [$ J] <$ A [$ J-1]) {$ T = $ A [$ J-1]; $ A [$ J-1] = $ A [$ J]; $ A [$ J] = $ t ;}} return $ ;}