PHP heap sort implementation code
The heap can be regarded as a complete binary tree. Except for the bottom layer, every level is full. This allows the heap to be represented by an array, and each node corresponds to an element in the array.
The relationship between arrays and heaps:
Binary heaps are generally divided into two types: maximum heap and minimum heap.
Max heap: The element value of each parent node in the heap is greater than or equal to its child node (if it exists);
Minimum heap: The element value of each parent node in the heap is less than or equal to its child Node (if it exists);
What is heap sort
Heap sort (assuming the maximum heap is used) is to take out the maximum number at the top of the heap, and continue to adjust the remaining heap to the maximum heap
Heap sorting algorithm
Building a heap: Building a heap is a process of constantly adjusting the heap, starting from len/2 and going to the first node, where len is the number of elements in the heap number. The process of building a heap is a linear process. The process of adjusting the heap is always called from len/2 to 0, which is equivalent to o(h1) + o(h2) ... + o(hlen/2) where h represents the depth of the node, len /2 represents the number of nodes. This is a summation process, and the result is linear O(n).
Adjustment heap: Adjustment heap will be used in the process of building the heap, and will also be used in the heap sorting process. The idea of utilizing is to compare node i and its child nodes left(i), right(i), and select the largest (or smallest) of the three. If the largest (smallest)
value is not node i but One of its child nodes interacts with node i and then calls the heap adjustment process. This is a recursive process. The time complexity of the process of adjusting the heap is related to the depth of the heap. It is a logn operation, because
is adjusted along the depth direction.
Heap sort: Heap sort is performed using the above two processes. The first is to build a heap based on elements. Then take out the root node of the heap (usually exchange it with the last node), continue the heap adjustment process for the first len-1 nodes, and then take out the root node again, until all Remove all nodes. The time complexity of the heap sort process is O(nlogn). Because the time complexity of building a heap is O(n) (one call); the time complexity of adjusting the heap is logn, and it takes n-1 times to adjust the heap, so the time complexity of heap sorting is O( nlogn).
Example:
<?php
// PHP 堆排序算法实现、堆排序时间复杂度分析
/**
* 堆排序
* @param array $arr
*/
function heap_sort(array &$arr)
{
$count = count($arr);
// 建堆 (下标小于或等于floor($count/2)-1的节点都是要调整的节点)
for($i = floor($count / 2) - 1; $i >= 0; $i --)
{
heap_adjust($arr, $i, $count);
}
// 调整堆
for($i = $count - 1; $i >= 0; $i--)
{
//将堆顶元素与最后一个元素交换
swap($arr,0,$i);
heap_adjust($arr,0,$i - 1);
}
}
/**
* 交换2个值
* @param array $arr
* @param int $a 数组下标
* @param int $b 数组下标
*/
function swap(array &$arr, $a, $b)
{
$temp = $arr[$a];
$arr[$a] = $arr[$b];
$arr[$b] = $temp;
}
/**
* 交换2个值
* @param array $arr
* @param int $start 数组下标
* @param int $end 数组下标
*/
function heap_adjust(array &$arr, $start, $end)
{
$temp = $arr[$start];
//沿关键字较大的孩子节点向下筛选，这里数组开始下标识0
for($j = 2 * $start + 1; $j <= $end; $j = 2 * $j + 1)
{
if($j != $end && $arr[$j] < $arr[$j + 1])
{
$j ++;
}
if($temp < $arr[$j])
{
//将根节点设置为子节点的较大值
$arr[$start] = $arr[$j];
$start = $j;
}
}
$arr[$start] = $temp;
}
// 使用
$arr = array(8,4,2,9,3,7,1,6,5);
heap_sort($arr);
print_r($arr);Output:
Array ([0] => 1 [1] => 2 [2] => 3 [3] = > 4 [4] => 5 [5] => 6 [6] => 7 [7] => 8 [8] => 9 )
Time complexity analysis
In general, the time complexity of heap sort is O(nlogn). Since heap sort is not sensitive to the sorting state of the original records, its best, worst, and average time complexity is O(nlogn). This is obviously far better in performance than the O(n^2) time complexity of bubbling, simple selection, and direct insertion.
Heap sorting is an unstable sorting method (the order of the same elements before and after sorting may change). Related recommendations:Detailed explanation of heap sorting of PHP sorting algorithm
Detailed explanation of PHP heap sort algorithm example
The above is the detailed content of PHP heap sort implementation code. For more information, please follow other related articles on the PHP Chinese website!
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
Notepad++7.3.1
Easy-to-use and free code editor
SublimeText3 Chinese version
Chinese version, very easy to use
Zend Studio 13.0.1
Powerful PHP integrated development environment
Dreamweaver CS6
Visual web development tools
SublimeText3 Mac version
God-level code editing software (SublimeText3)
Hot Topics
1666
14
1426
52
1328
25
1273
29
1255
24
PHP: A Key Language for Web Development
Apr 13, 2025 am 12:08 AM
PHP is a scripting language widely used on the server side, especially suitable for web development. 1.PHP can embed HTML, process HTTP requests and responses, and supports a variety of databases. 2.PHP is used to generate dynamic web content, process form data, access databases, etc., with strong community support and open source resources. 3. PHP is an interpreted language, and the execution process includes lexical analysis, grammatical analysis, compilation and execution. 4.PHP can be combined with MySQL for advanced applications such as user registration systems. 5. When debugging PHP, you can use functions such as error_reporting() and var_dump(). 6. Optimize PHP code to use caching mechanisms, optimize database queries and use built-in functions. 7
PHP and Python: Comparing Two Popular Programming Languages
Apr 14, 2025 am 12:13 AM
PHP and Python each have their own advantages, and choose according to project requirements. 1.PHP is suitable for web development, especially for rapid development and maintenance of websites. 2. Python is suitable for data science, machine learning and artificial intelligence, with concise syntax and suitable for beginners.
PHP vs. Python: Understanding the Differences
Apr 11, 2025 am 12:15 AM
PHP and Python each have their own advantages, and the choice should be based on project requirements. 1.PHP is suitable for web development, with simple syntax and high execution efficiency. 2. Python is suitable for data science and machine learning, with concise syntax and rich libraries.
PHP in Action: Real-World Examples and Applications
Apr 14, 2025 am 12:19 AM
PHP is widely used in e-commerce, content management systems and API development. 1) E-commerce: used for shopping cart function and payment processing. 2) Content management system: used for dynamic content generation and user management. 3) API development: used for RESTful API development and API security. Through performance optimization and best practices, the efficiency and maintainability of PHP applications are improved.
The Enduring Relevance of PHP: Is It Still Alive?
Apr 14, 2025 am 12:12 AM
PHP is still dynamic and still occupies an important position in the field of modern programming. 1) PHP's simplicity and powerful community support make it widely used in web development; 2) Its flexibility and stability make it outstanding in handling web forms, database operations and file processing; 3) PHP is constantly evolving and optimizing, suitable for beginners and experienced developers.
PHP vs. Other Languages: A Comparison
Apr 13, 2025 am 12:19 AM
PHP is suitable for web development, especially in rapid development and processing dynamic content, but is not good at data science and enterprise-level applications. Compared with Python, PHP has more advantages in web development, but is not as good as Python in the field of data science; compared with Java, PHP performs worse in enterprise-level applications, but is more flexible in web development; compared with JavaScript, PHP is more concise in back-end development, but is not as good as JavaScript in front-end development.
PHP and Python: Different Paradigms Explained
Apr 18, 2025 am 12:26 AM
PHP is mainly procedural programming, but also supports object-oriented programming (OOP); Python supports a variety of paradigms, including OOP, functional and procedural programming. PHP is suitable for web development, and Python is suitable for a variety of applications such as data analysis and machine learning.
PHP and Python: Code Examples and Comparison
Apr 15, 2025 am 12:07 AM
PHP and Python have their own advantages and disadvantages, and the choice depends on project needs and personal preferences. 1.PHP is suitable for rapid development and maintenance of large-scale web applications. 2. Python dominates the field of data science and machine learning.
