In PHP, array is a very powerful data structure. With PHP arrays, we can easily store and manipulate large amounts of data. But what do we do when we need to find the median from an unordered array?
The median (also called the median) is the middle value in an array. It divides the array into two parts. All values on the left are smaller than it and all values on the right are larger. . If the array has an even number of elements, the median is the average of the middle two elements.
Although PHP provides the sort() function, which can be used to sort arrays, when sorting large arrays, the time complexity of this function will reach O(nlogn) and the sorting of the array will be modified. order, this is not what we want.
So, how do we find the median of an unordered array in PHP without changing the order of the array? Let us take a look below.
- Use quick sort to find the median number
The quick sort algorithm is a comparison-based sorting algorithm, and its time complexity under average circumstances is O(nlogn) , and does not require additional memory space. Therefore, we can use quick sort to sort the array and find the median.
The main idea of the quick sort algorithm is to select a benchmark element in the array, and then divide the array into two parts. One part contains all values that are smaller than the benchmark element, and the other part contains all values that are greater than the benchmark element. . These two parts are then sorted recursively until the entire array is sorted.
In order to find the median of an unordered array, we can use the quick sort algorithm to sort it first, and then determine the median based on the length of the sorted array.
The following is an example of PHP code that uses quick sort to find the middle number:
function quickSort($arr){ $len = count($arr); if($len <ol start="2"><li>Uses heap sort to find the middle number</li></ol><p>The heap sort algorithm is a Sorting algorithm for heap-based tree data structures. In heap sort, we sort the array by building a max-heap or min-heap. We can use max heap to find the median of an unordered array. </p><p>Maximum heap is a binary tree that satisfies the following properties: </p><p>1. The value of each node of the heap is greater than or equal to the value of its left and right child nodes. </p><p>2. The heap is always a complete binary tree. </p><p>For an unordered array, we can sort it by building a max heap. Then, we can find the median based on the properties of the maximum heap. </p><p>The following is an example of PHP code that uses heap sort to find the median: </p><pre class="brush:php;toolbar:false">function buildMaxHeap(&$arr, $index, $heapSize){ $left = 2*$index+1; $right = 2*$index+2; $max = $index; if($left$arr[$max]){ $max = $left; } if($right$arr[$max]){ $max = $right; } if($max != $index){ $temp = $arr[$index]; $arr[$index] = $arr[$max]; $arr[$max] = $temp; buildMaxHeap($arr, $max, $heapSize); } } function heapSort(&$arr){ $heapSize = count($arr); for($i=intval($heapSize/2)-1; $i>=0; $i--){ buildMaxHeap($arr, $i, $heapSize); } for($i=$heapSize-1; $i>=1; $i--){ $temp = $arr[0]; $arr[0] = $arr[$i]; $arr[$i] = $temp; $heapSize--; buildMaxHeap($arr, 0, $heapSize); } } $arr = array(3, 9, 2, 7, 1, 5, 6); heapSort($arr); $len = count($arr); if($len % 2 == 0){ $middle = ($arr[$len/2-1] + $arr[$len/2])/2; }else{ $middle = $arr[($len-1)/2]; } echo "中数为:".$middle;
Summary
The above are two methods of finding the median in an unordered array in PHP. Although their time complexity is different, they can all implement the functions of quickly sorting unordered arrays and finding the median. If you need to sort a large number of unordered arrays and find the median, it is recommended that you use the heap sort algorithm, which has better time complexity performance.
The above is the detailed content of How to find the median from an unordered array in php. For more information, please follow other related articles on the PHP Chinese website!

This article explores efficient PHP array deduplication. It compares built-in functions like array_unique() with custom hashmap approaches, highlighting performance trade-offs based on array size and data type. The optimal method depends on profili

This article analyzes PHP array deduplication, highlighting performance bottlenecks of naive approaches (O(n²)). It explores efficient alternatives using array_unique() with custom functions, SplObjectStorage, and HashSet implementations, achieving

This article explores PHP array deduplication using key uniqueness. While not a direct duplicate removal method, leveraging key uniqueness allows for creating a new array with unique values by mapping values to keys, overwriting duplicates. This ap

This article details implementing message queues in PHP using RabbitMQ and Redis. It compares their architectures (AMQP vs. in-memory), features, and reliability mechanisms (confirmations, transactions, persistence). Best practices for design, error

This article examines current PHP coding standards and best practices, focusing on PSR recommendations (PSR-1, PSR-2, PSR-4, PSR-12). It emphasizes improving code readability and maintainability through consistent styling, meaningful naming, and eff

This article explores optimizing PHP array deduplication for large datasets. It examines techniques like array_unique(), array_flip(), SplObjectStorage, and pre-sorting, comparing their efficiency. For massive datasets, it suggests chunking, datab

This article details installing and troubleshooting PHP extensions, focusing on PECL. It covers installation steps (finding, downloading/compiling, enabling, restarting the server), troubleshooting techniques (checking logs, verifying installation,

This article explains PHP's Reflection API, enabling runtime inspection and manipulation of classes, methods, and properties. It details common use cases (documentation generation, ORMs, dependency injection) and cautions against performance overhea


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

AI Hentai Generator
Generate AI Hentai for free.

Hot Article

Hot Tools

Safe Exam Browser
Safe Exam Browser is a secure browser environment for taking online exams securely. This software turns any computer into a secure workstation. It controls access to any utility and prevents students from using unauthorized resources.

SublimeText3 Linux new version
SublimeText3 Linux latest version

SublimeText3 Chinese version
Chinese version, very easy to use

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Mac version
God-level code editing software (SublimeText3)
