算法课之二叉堆操作

代码：

#include<iostream>
#include<string>
#include<algorithm>
#include<sstream>
#include<vector>

using namespace std;

//H=make heap():to create a new heap H;

void Adjust_down(vector<int>& v,int i,int max_index) {
	if (2 * i + 1 > max_index)return;
	int index = 0;
	if (2 * i + 2 > max_index)index = 2 * i + 1;
	else { index = v[2 * i + 1] < v[2 * i + 2] ? (2 * i + 1) : (2 * i + 2); }
	if (v[index] > v[i])return;

	int temp = v[i];
	v[i] = v[index];
	v[index] = temp;

	Adjust_down(v, index, max_index);

}

void Adjust_up(vector<int>& H,int current) {
	while (H[current] < H[(current - 1) / 2]) {
		int temp = H[current];
		H[current] = H[(current - 1) / 2];
		H[(current - 1) / 2] = temp;
		current = (current - 1) / 2;
	}
}
void buildheap(vector<int>& v) {
	int max_index = v.size() - 1;
	for (int i = (max_index-1) / 2; i >= 0; i--) {
		Adjust_down(v, i, max_index);
	}
}
//insert(H,x): to insert into H an element x together with its priority
void insert(vector<int>& H, int x) {
	H.push_back(x);
	int current = H.size() - 1;
	Adjust_up(H, current);
}
//ExtractMin(): to extract the element with the highest priority;
int ExtractMin(vector<int>& v) {
	int max_index = v.size() - 1;
	int temp = v[0];
	v[0] = v[max_index];
	v.pop_back();
	Adjust_down(v, 0, max_index - 1);
	return temp;
}
//DecreaseKey(H,x,k):to decrease the priority of element x;
void DecreaseKey(vector<int>& v, int index, int k) {
	v[index] = k;
	Adjust_up(v, index);
	Adjust_down(v, index, v.size() - 1);
}


int main() {
	
	vector<int> v = { 9,3,7,6,5,1,10,2 };
	buildheap(v);
	insert(v, 0);
	int min_num = ExtractMin(v);
	DecreaseKey(v, 1, 7);
	return 0;
}