php实现堆排序

abstract class Heap {
    protected $elements = array();
    protected $n = 0;
    
    public abstract function insert($element);

    public function isEmpty() {
        return $this->n==0;
    }
    
    public function all(){
        return $this->elements;
    }

    /**
     * Extract the top value of the heap
     *
    */
    public function extract() {
        $element = $this->elements[1];
        $this->elements[1] = array_pop($this->elements);
        $this->n--;
        $this->siftDown();
        return $element;
    }
    
    /**
     * Rearranges the heap after an extraction to keep the heap property
     */
    protected abstract function siftDown();

    /**
     * Swap two elements on the elements array
     *
     */
    protected function swap($x,$y) {
        $tmp = $this->elements[$x];
        $this->elements[$x] = $this->elements[$y];
        $this->elements[$y] = $tmp;
    }
}
class MinHeap extends Heap {
    
    public function insert($element) {
        $this->elements[++$this->n] = $element;
        for ($i = $this->n; $i > 1 && $this->elements[$i >> 1] > $this->elements[$i]; $i = $i >> 1)
            $this->swap($i >> 1,$i);
    }
    protected function siftDown() {
        for ($i = 1; ($c = $i * 2) <= $this->n; $i = $c) {
            //Checks which of the smaller child to compare with the parent
            if ($c+1 <= $this->n && $this->elements[$c+1] < $this->elements[$c])
                $c++;
            if ($this->elements[$i] < $this->elements[$c])
                break;
            $this->swap($c, $i);
        }
    }

}

function heapSort($array){
    $heap=new MinHeap();
    foreach($array as $val){
        $heap->insert($val);
        
    }    
    $arr=array();
    while(!$heap->isEmpty()){
        $arr[]=$heap->extract();
    }    
    return $arr;
}
$array=array(1,13,8,4,5);
$arr=heapSort($array);
print_r($arr);