zeroArn

摘要： //max_heap heap_maximum:return A[1] O(1); Extract_Heap_maximum:swap(A[1],A[heap.size]) adjust up to down from A[1] to hold the max_heap character O(lg 阅读全文

摘要： //用满二叉树存储，从n/2处开始递归向上调整（n/2后均为叶子节点，无需调整）使得根最大 //满二叉树顺序存储，左子2i,右子2i+1； #include<stdio.h>#include<stdlib.h>#include<time.h>#define ARRAY_SIZE 1000#defin 阅读全文