HeapSort.php

HeapSort.php

<?php
/**
 * Heap Sort.
 *
 * Keywords: heap
 * Time Complexity: O(n log n)
 * Space Complexity: O(1)
 */
class HeapSort extends SplHeap
{
    public function  compare($value1, $value2)
    { 
        return ($value2 - $value1); 
    }
}
# Example.
$array = [24,2,20,12,33,10,11];
$obj = new HeapSort;
foreach ($array as $v) {
    $obj->insert($v);
}
foreach ($obj as $num) {
    echo $num, "\n";
}
# end of this file.