堆排序

#ifndef HEAP_SORT_H#define HEAP_SORT_H#define Parent(i) (i / 2)#define Left(i) (2 * i)#define Right(i) (2 * i + 1)//the root is at index 1/** * @brief Make tree i to be Max-Heap when its Left and Right sub-trees are Max-Heap. The complexity is O(log(n)) * * @tparam T: template type * @param array: the heap array * @param size: the size of the array * @param i: the node in i */template <typename T>void MaxHeapIfy(T *array, int size, int i){ int max = i; //compare the root with its left child if (Left(i) <= size && array[max] < array[Left(i)]) { max = Left(i); } //compare the max with i's right child if (Right(i) <= size && array[max] < array[Right(i)]) { max = Right(i); } //if the max is not i, swap them and recursively invote if (max != i) { T temp = array[max]; array[max] = array[i]; array[i] = temp; MaxHeapIfy(array, size, max); }}/** * @brief Build the array into heap. The complexity is O(n) * * @tparam V: template type * @param array: the array to be built into heap * @param size: the size of the array */template <typename V>void BuildMaxHeap(V *array, int size){ for (int i = size / 2; i > 0; --i) { MaxHeapIfy(array, size, i); }}/** * @brief Get the sorted array, little to large. The complexity is O(n*log(n)) * * @tparam R: template type * @param array: the array to be sorted * @param size: the size of the array */template <typename R>void MaxHeapSort(R *array, int size){ BuildMaxHeap(array, size); for (int i = size; i > 1; --i) { R temp = array[1]; array[1] = array[i]; //move the largest node to the tail array[i] = temp; MaxHeapIfy(array, i - 1, 1); }}#endif /* end of include guard: HEAP_SORT_H */