摘要：
堆排序具有合并排序（时间复杂度O（nlgn）低）和插入排序（空间消耗少）的优点。#include#include#include#include#define MAX 10int size;int MAX_Heapify(int A[],int i){ int l,r,largest; l = i*2+1; r = i*2 + 2; if(l A[i]) largest = l; else largest = i; if(r A[largest]) largest = r; if(largest != i) { int tmp = A[i]; A[i] = A[largest];... 阅读全文
