C++模板实现堆排序

堆的概念我在之前的文章中已经有说明,这里不再赘述.本小结的内容仅包括堆排序部分.

算法特点:
1.不稳定.
2.时间复杂度 O(nlog(n))
3.空间复杂度 O(nlog(n))

在堆删除节点的同时,正好可以巧妙的将该数据放置到数组被删掉的位置,最后得到排序好的数组(堆的根节点被弹出后,总是将最后节点重新放置到跟节点,这样,最后节点位置正好空出).

//Heapsort//1. Not Stable//2. Time complex O(nlog(n))//3. Space complecity, O(nlog(n))//4. No specialtemplate <typename T, unsigned int size>void Sort<T,size>::heapSort(T * const sortArray/*, const unsigned int size*/){    Heap<T, size> heap;    TimeAndSpace timeAndSpace;    //Construct the heap    for (unsigned int i = 0; i < size; i++)    {        timeAndSpace = heap.AddElem(sortArray[i]);        loopTimes += timeAndSpace.times;        moveTimes += timeAndSpace.moves;    }    for (unsigned int i = 0; i < size; i++)    {        T value;        timeAndSpace = heap.deleteElem(value);        loopTimes += timeAndSpace.times;        moveTimes += timeAndSpace.moves;        sortArray[size - 1 - i] = value;    }    return;}