Muto_33的博客

#include #include #include using namespace std; #define Type int #define null NULL struct nodeone{ //单向链表 Type data; nodeone *next; }; struct nodetwo { //双向循环链表 Type data; nodetwo*pre; nodet

原理可参见：点击打开链接 运行代码： #include using namespace std; class heapSort{ private: int* array; int maxSize; int currentSize; public: heapSort(); ~heapSort(); void buildHeap(int size); bool isLeftChild