


Foreword
The following is a classic algorithm implemented through PHP, and the time consumption is calculated. The complexity of these algorithms can be compared by the time consumption.
- Insertion sort
- Bubble sort
- Selection sort
- Merge sort
- Quick sort
CODE
<code><span>$arr</span> = []; <span>for</span> (<span>$i</span> = <span>0</span>; <span>$i</span> 5000; <span>$i</span>++) { <span>$arr</span>[] = rand(<span>1</span>, <span>10000</span>); } <span>//1 插入排序</span><span><span>function</span><span>insertionSort</span><span>(<span>$arr</span>)</span> {</span><span>for</span> (<span>$i</span> = <span>1</span>; <span>$i</span> $arr); <span>$i</span>++) { <span>$tmp</span> = <span>$arr</span>[<span>$i</span>]; <span>//设置监视哨</span><span>$key</span> = <span>$i</span> - <span>1</span>; <span>//设置开始查找的位置</span><span>while</span> (<span>$key</span> >= <span>0</span> && <span>$tmp</span> $arr[<span>$key</span>]) { <span>// 监视哨的值比查找的值小 并且 没有到此次查询的第一个</span><span>$arr</span>[<span>$key</span> + <span>1</span>] = <span>$arr</span>[<span>$key</span>]; <span>//数组的值进行后移</span><span>$key</span>--; <span>//要查找的位置后移</span> } <span>if</span> ((<span>$key</span> + <span>1</span>) != <span>$i</span>) <span>//放置监视哨</span><span>$arr</span>[<span>$key</span> + <span>1</span>] = <span>$tmp</span>; } <span>return</span><span>$arr</span>; } <span>$insertion_start_time</span> = microtime(<span>true</span>); <span>$insertion_sort</span> = insertionSort(<span>$arr</span>); <span>$insertion_end_time</span> = microtime(<span>true</span>); <span>$insertion_need_time</span> = <span>$insertion_end_time</span> - <span>$insertion_start_time</span>; print_r(<span>"插入排序耗时:"</span> . <span>$insertion_need_time</span> . <span>"<br>"</span>); <span>//2 冒泡排序</span><span><span>function</span><span>bubbleSort</span><span>(<span>$arr</span>)</span> {</span><span>for</span> (<span>$i</span> = <span>0</span>; <span>$i</span> $arr); <span>$i</span>++) { <span>for</span> (<span>$j</span> = <span>0</span>; <span>$j</span> $i + <span>1</span>; <span>$j</span>++) { <span>if</span> (<span>$arr</span>[<span>$j</span>] $arr[<span>$j</span> - <span>1</span>]) { <span>$temp</span> = <span>$arr</span>[<span>$j</span> - <span>1</span>]; <span>$arr</span>[<span>$j</span> - <span>1</span>] = <span>$arr</span>[<span>$j</span>]; <span>$arr</span>[<span>$j</span>] = <span>$temp</span>; } } } <span>return</span><span>$arr</span>; } <span>$bubble_start_time</span> = microtime(<span>true</span>); <span>$bubble_sort</span> = bubbleSort(<span>$arr</span>); <span>$bubble_end_time</span> = microtime(<span>true</span>); <span>$bubble_need_time</span> = <span>$bubble_end_time</span> - <span>$bubble_start_time</span>; print_r(<span>"冒泡排序耗时:"</span> . <span>$bubble_need_time</span> . <span>"<br>"</span>); <span>//3 选择排序</span><span><span>function</span><span>selectionSort</span><span>(<span>$arr</span>)</span> {</span><span>$count</span> = count(<span>$arr</span>); <span>for</span> (<span>$i</span> = <span>0</span>; <span>$i</span> $count - <span>1</span>; <span>$i</span>++) { <span>//找到最小的值</span><span>$min</span> = <span>$i</span>; <span>for</span> (<span>$j</span> = <span>$i</span> + <span>1</span>; <span>$j</span> $count; <span>$j</span>++) { <span>//由小到大排列</span><span>if</span> (<span>$arr</span>[<span>$min</span>] > <span>$arr</span>[<span>$j</span>]) { <span>//表明当前最小的还比当前的元素大</span><span>$min</span> = <span>$j</span>; <span>//赋值新的最小的</span> } } <span>/*swap$array[$i]and$array[$min]即将当前内循环的最小元素放在$i位置上*/</span><span>if</span> (<span>$min</span> != <span>$i</span>) { <span>$temp</span> = <span>$arr</span>[<span>$min</span>]; <span>$arr</span>[<span>$min</span>] = <span>$arr</span>[<span>$i</span>]; <span>$arr</span>[<span>$i</span>] = <span>$temp</span>; } } <span>return</span><span>$arr</span>; } <span>$selection_start_time</span> = microtime(<span>true</span>); <span>$selection_sort</span> = selectionSort(<span>$arr</span>); <span>$selection_end_time</span> = microtime(<span>true</span>); <span>$selection_need_time</span> = <span>$selection_end_time</span> - <span>$selection_start_time</span>; print_r(<span>"选择排序耗时:"</span> . <span>$selection_need_time</span> . <span>"<br>"</span>); <span>//4 并归排序</span><span>//merge函数将指定的两个有序数组(arr1arr2,)合并并且排序</span><span>//我们可以找到第三个数组,然后依次从两个数组的开始取数据哪个数据小就先取哪个的,然后删除掉刚刚取过///的数据</span><span><span>function</span><span>al_merge</span><span>(<span>$arrA</span>, <span>$arrB</span>)</span> {</span><span>$arrC</span> = <span>array</span>(); <span>while</span> (count(<span>$arrA</span>) && count(<span>$arrB</span>)) { <span>//这里不断的判断哪个值小,就将小的值给到arrC,但是到最后肯定要剩下几个值,</span><span>//不是剩下arrA里面的就是剩下arrB里面的而且这几个有序的值,肯定比arrC里面所有的值都大所以使用</span><span>$arrC</span>[] = <span>$arrA</span>[<span>'0'</span>] $arrB[<span>'0'</span>] ? array_shift(<span>$arrA</span>) : array_shift(<span>$arrB</span>); } <span>return</span> array_merge(<span>$arrC</span>, <span>$arrA</span>, <span>$arrB</span>); } <span>//归并排序主程序</span><span><span>function</span><span>al_merge_sort</span><span>(<span>$arr</span>)</span> {</span><span>$len</span> = count(<span>$arr</span>); <span>if</span> (<span>$len</span> 1) <span>return</span><span>$arr</span>;<span>//递归结束条件,到达这步的时候,数组就只剩下一个元素了,也就是分离了数组</span><span>$mid</span> = intval(<span>$len</span> / <span>2</span>);<span>//取数组中间</span><span>$left_arr</span> = array_slice(<span>$arr</span>, <span>0</span>, <span>$mid</span>);<span>//拆分数组0-mid这部分给左边left_arr</span><span>$right_arr</span> = array_slice(<span>$arr</span>, <span>$mid</span>);<span>//拆分数组mid-末尾这部分给右边right_arr</span><span>$left_arr</span> = al_merge_sort(<span>$left_arr</span>);<span>//左边拆分完后开始递归合并往上走</span><span>$right_arr</span> = al_merge_sort(<span>$right_arr</span>);<span>//右边拆分完毕开始递归往上走</span><span>$arr</span> = al_merge(<span>$left_arr</span>, <span>$right_arr</span>);<span>//合并两个数组,继续递归</span><span>return</span><span>$arr</span>; } <span>$merge_start_time</span> = microtime(<span>true</span>); <span>$merge_sort</span> = al_merge_sort(<span>$arr</span>); <span>$merge_end_time</span> = microtime(<span>true</span>); <span>$merge_need_time</span> = <span>$merge_end_time</span> - <span>$merge_start_time</span>; print_r(<span>"并归排序耗时:"</span> . <span>$merge_need_time</span> . <span>"<br>"</span>); <span>//5 快速排序</span><span><span>function</span><span>quickSort</span><span>(&<span>$arr</span>)</span>{</span><span>if</span>(count(<span>$arr</span>)><span>1</span>){ <span>$k</span>=<span>$arr</span>[<span>0</span>]; <span>$x</span>=<span>array</span>(); <span>$y</span>=<span>array</span>(); <span>$_size</span>=count(<span>$arr</span>); <span>for</span>(<span>$i</span>=<span>1</span>;<span>$i</span>$_size;<span>$i</span>++){ <span>if</span>(<span>$arr</span>[<span>$i</span>]$k){ <span>$x</span>[]=<span>$arr</span>[<span>$i</span>]; }<span>elseif</span>(<span>$arr</span>[<span>$i</span>]><span>$k</span>){ <span>$y</span>[]=<span>$arr</span>[<span>$i</span>]; } } <span>$x</span>=quickSort(<span>$x</span>); <span>$y</span>=quickSort(<span>$y</span>); <span>return</span> array_merge(<span>$x</span>,<span>array</span>(<span>$k</span>),<span>$y</span>); }<span>else</span>{ <span>return</span><span>$arr</span>; } } <span>$quick_start_time</span> = microtime(<span>true</span>); <span>$quick_sort</span> = al_merge_sort(<span>$arr</span>); <span>$quick_end_time</span> = microtime(<span>true</span>); <span>$quick_need_time</span> = <span>$quick_end_time</span> - <span>$quick_start_time</span>; print_r(<span>"快速排序耗时:"</span> . <span>$quick_need_time</span> . <span>"<br>"</span>); </code>
Time-consuming comparison
Insertion sort time-consuming: 1.2335460186005
Bubble sorting time: 2.6180219650269
Selection sorting time: 1.4159741401672
Merge sorting time: 0.17212891578674
Quick sort takes time: 0.16736888885498
References
- Introduction to Algorithms
The above introduces the implementation of classic algorithms in PHP, including PHP and classic aspects. I hope it will be helpful to friends who are interested in PHP tutorials.

TomodifydatainaPHPsession,startthesessionwithsession_start(),thenuse$_SESSIONtoset,modify,orremovevariables.1)Startthesession.2)Setormodifysessionvariablesusing$_SESSION.3)Removevariableswithunset().4)Clearallvariableswithsession_unset().5)Destroythe

Arrays can be stored in PHP sessions. 1. Start the session and use session_start(). 2. Create an array and store it in $_SESSION. 3. Retrieve the array through $_SESSION. 4. Optimize session data to improve performance.

PHP session garbage collection is triggered through a probability mechanism to clean up expired session data. 1) Set the trigger probability and session life cycle in the configuration file; 2) You can use cron tasks to optimize high-load applications; 3) You need to balance the garbage collection frequency and performance to avoid data loss.

Tracking user session activities in PHP is implemented through session management. 1) Use session_start() to start the session. 2) Store and access data through the $_SESSION array. 3) Call session_destroy() to end the session. Session tracking is used for user behavior analysis, security monitoring, and performance optimization.

Using databases to store PHP session data can improve performance and scalability. 1) Configure MySQL to store session data: Set up the session processor in php.ini or PHP code. 2) Implement custom session processor: define open, close, read, write and other functions to interact with the database. 3) Optimization and best practices: Use indexing, caching, data compression and distributed storage to improve performance.

PHPsessionstrackuserdataacrossmultiplepagerequestsusingauniqueIDstoredinacookie.Here'showtomanagethemeffectively:1)Startasessionwithsession_start()andstoredatain$_SESSION.2)RegeneratethesessionIDafterloginwithsession_regenerate_id(true)topreventsessi

In PHP, iterating through session data can be achieved through the following steps: 1. Start the session using session_start(). 2. Iterate through foreach loop through all key-value pairs in the $_SESSION array. 3. When processing complex data structures, use is_array() or is_object() functions and use print_r() to output detailed information. 4. When optimizing traversal, paging can be used to avoid processing large amounts of data at one time. This will help you manage and use PHP session data more efficiently in your actual project.

The session realizes user authentication through the server-side state management mechanism. 1) Session creation and generation of unique IDs, 2) IDs are passed through cookies, 3) Server stores and accesses session data through IDs, 4) User authentication and status management are realized, improving application security and user experience.


Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

PhpStorm Mac version
The latest (2018.2.1) professional PHP integrated development tool

MinGW - Minimalist GNU for Windows
This project is in the process of being migrated to osdn.net/projects/mingw, you can continue to follow us there. MinGW: A native Windows port of the GNU Compiler Collection (GCC), freely distributable import libraries and header files for building native Windows applications; includes extensions to the MSVC runtime to support C99 functionality. All MinGW software can run on 64-bit Windows platforms.

EditPlus Chinese cracked version
Small size, syntax highlighting, does not support code prompt function

DVWA
Damn Vulnerable Web App (DVWA) is a PHP/MySQL web application that is very vulnerable. Its main goals are to be an aid for security professionals to test their skills and tools in a legal environment, to help web developers better understand the process of securing web applications, and to help teachers/students teach/learn in a classroom environment Web application security. The goal of DVWA is to practice some of the most common web vulnerabilities through a simple and straightforward interface, with varying degrees of difficulty. Please note that this software

ZendStudio 13.5.1 Mac
Powerful PHP integrated development environment
