堆排序、优先级队列（c++模板实现）

#include <iostream> #include <iomanip> #include "prioriy_queue.h" using namespace std; int main() { const int length = 10; int array2[length] = {15, 13, 9, 5, 12, 8, 7, 4, 0, 6, }; int *array = new int[length]; int array_length=0; // Priority_Queue<int> priority_queue(20, Maximum_Priority_Queue); Priority_Queue<int> priority_queue; for( int i = 0; i < length; ++i ) priority_queue.enqueue( &array2[i] ); priority_queue.test(); }