利用优先队列实现堆排序(自顶向下自底向上堆化彻底二叉树的运用)

源代码以下：node #include <stdio.h> #include <stdlib.h> typedef struct Item *node; struct Item{ int data; char c; }; static Item *pq; static int N ; void swap(Item &a,Item &b){struct Item t = a;a = b;b =

>>阅读原文<<