摘要:
代码:#include "iostream"using namespace std;int heap_size;int left(int i){ return 2*i;}int right(int i){ return 2*i+1;}void max_Heapify(int A[],int i){ int l,r,largest; l=left(i); r=right(i); int temp; if(l<=heap_size&&A[i]<A[l]) largest=l; else largest=i; if(r... 阅读全文
摘要:
代码:#include "iostream"#define MAX 0x7fffffffusing namespace std;int B[20],heap_size=0;int counter=0;int parent(int i){ return i/2;}int left(int i){ return 2*i;}int right(int i){ return 2*i+1;}void decrease_Key(int A[],int i,int key){ int temp; A[i]=key; while(i>1&&A[parent(i)]&g 阅读全文