PHP file operations and algorithms-PHP Tutorial-php.cn

This article mainly introduces PHP file operations and algorithms. Interested friends can refer to it. I hope it will be helpful to everyone.

Operating files

1. Use more than 5 methods to obtain the extension of a file

Requirements: dir/upload.image.jpg, Find .jpg or jpg

"; echo two($str); echo "
"; echo three($str); echo "
"; echo four($str); echo "
"; echo five($str); echo "
";

Copy after login

2. Write a php function to calculate the relative paths of the two files. For example, $a="/a/b/c/d/e.php"; $b="/a/b/12/34/c.php", what is the relative path of B relative to A?

This question can be seen as a question about finding the first public node. Most of the codes circulating on the Internet are wrong and not well thought out. Of course, I only use "../" to express this. Useless "./"

 $counta) { while ($countb > $counta) { $path .= "../"; $countb --; } } // 寻找第一个公共结点 for ($i = $countb - 1; $i >= 0;) { if ($patha[$i] != $pathb[$i]) { $path .= "../"; $i --; } else { // 判断是否为真正的第一个公共结点，防止出现子目录重名情况 for ($j = $i - 1, $flag = 1; $j >= 0; $j --) { if ($patha[$j] == $pathb[$j]) { continue; } else { $flag = 0; break; } } if ($flag) break; else $i ++; } } for ($i += 1; $i <= $counta; $i ++) { $path .= $patha[$i] . "/"; } return $path; } $a = "/a/c/d/e.php"; $b = "/a/c.php"; $path = getRelativePath($a, $b); echo $path;

Copy after login

Algorithm

1. Use PHP to describe bubble sort and quick sort, the object can be an array

 $array[$j + 1]) { $tmp = $array[$j]; $array[$j] = $array[$j + 1]; $array[$j + 1] = $tmp; } } } } /** * 快速排序 */ function pivotParation (&$array, $start, $end) { $stand = $array[$start]; while ($start < $end) { while ($start < $end && $array[$end] >= $stand) { $end --; } if ($start < $end) { $array[$start ++] = $array[$end]; } while ($start < $end && $array[$start] <= $stand) { $start ++; } if ($start < $end) { $array[$end --] = $array[$start]; } } $array[$start] = $stand; return $start; } function quickSort (&$array, $begin, $end) { if ($begin < $end) { $pivot = pivotParation($array, $begin, $end); quickSort($array, $begin, $pivot - 1); quickSort($array, $pivot + 1, $end); } } $arr = array( 5, 1, 3, 2, 19, 11, 25, 12, 100, 10000, 12 ); // 冒泡排序 maopaoSort($arr); print_r($arr); echo "
"; // 快速排序 $count = count($arr); quickSort($arr, 0, $count - 1); print_r($arr);

Copy after login

2. Use PHP to describe sequential search and binary search

 $needle) { $end = $mid - 1; } else { $start = $mid + 1; } } return - 1; } $arr = array( 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 ); $needle = 5; echo seqSearch($arr, $needle); echo "
"; echo midSearch($arr, 0, count($arr) - 1, $needle);

Copy after login

3. Write a two-dimensional array sorting algorithm function that can be universal and call PHP built-in functions

/** * Description:获取中枢点的位置 * * @param array $array * @param int $left * @param int $right * @param string $field * @return int */ function fetchArrayPivot (&$array, $left, $right, $field) { // 基准定义 $stand = $array[$left]; // 遍历数组 while ($left < $right) { while ($left < $right && $array[$right][$field] >= $stand[$field]) { $right --; } if ($left < $right) { $array[$left ++] = $array[$right]; } while ($left < $right && $array[$left][$field] <= $stand[$field]) { $left ++; } if ($left < $right) { $array[$right --] = $array[$left]; } } // 获取中枢点位置 $array[$left] = $stand; return $left; } /** * Description:快速排序主程序 * * @param array $array * @param int $begin * @param int $end * @param string $field */ function quickSort (&$array, $begin, $end, $field) { // 变量定义 $pivot = null; if ($begin < $end) { $pivot = fetchArrayPivot($array, $begin, $end, $field); quickSort($array, $begin, $pivot - 1, $field); quickSort($array, $pivot + 1, $end, $field); } }

Copy after login

Summary: The above is the entire content of this article, I hope it will be helpful to everyone's study.

Related recommendations:

Detailed explanation of how to create a WeChat custom menu in PHP

Data structure in PHP Detailed explanation of DS extension

Detailed explanation of methods of communication data encapsulation class of PHP common operation classes

The above is the detailed content of PHP file operations and algorithms. For more information, please follow other related articles on the PHP Chinese website!