头文件#include<algorithm>
一.void make_heap(first_pointer,end_pointer,compare_function)
①end_pointer:为尾后地址或尾后迭代器,而不是最后一个元素地址
②作用:把一个数组或一个向量做成一个堆
③默认大根堆
static bool cmp(int a,int b){//默认即是大根堆
return a<b?true:false;
}
int main() {
vector<int>a{10,20,30,5,15};
int b[5]={10,20,30,5,15};
make_heap(a.begin(),a.end(),cmp);//数组:make_heap(&b[0],&b[5])或make_heap(b,b+5)
for(auto m:a){
cout<<m<<" ";
}
cout<<endl;
}
二.pop_heap(first_pointer,end_pointer,compare_function)
并不是真的把元素弹出来,而是把第一个元素和最后一个元素交换位置,对[first,last-1)重新构堆
pop_heap(a.begin(),a.end());
a.pop_back();//删除vector中最后一个元素,但不回收内存 或者a.erase(--a.end(),a.end());
for(auto m:a){
cout<<m<<" ";
}
cout<<endl;
三.void push_heap(first_pointer,end_pointer,compare_function)
a.push_back(99);
push_heap(a.begin(),a.end());
for(auto m:a){
cout<<m<<" ";
}
cout<<endl;
四.void sort_heap(first_pointer,end_pointer,compare_function)
排序之后就不再是有效堆了
sort_heap(a.begin(),a.end());
for(auto m:a){
cout<<m<<" ";
}