stl make_heap

What is Heap Data structure?

什么是堆数据结构？

Heap is a tree-based which is used for fast retrieval of largest (max heap) or smallest (min heap) element. This DS is used in the priority queue, prims algo, heap sort and many more.

堆是基于树的，用于快速检索最大(最大堆)或最小(最小堆)元素。 该DS用于优先级队列，原始算法，堆排序等。

make_heap()函数 (make_heap() function)

Syntax:

句法：

    make_heap( arg1, agr2 ,[arg3])

Here,

这里，

• arg1 = pointer or iterator to starting of the number list

  arg1 =指向数字列表开头的指针或迭代器

• arg2 = pointer or iterator to ending of the number list

  arg2 =指向数字列表结尾的指针或迭代器

• arg3 = optional, use to change default nature of the heap i.e is max heap to min heap

  arg3 =可选，用于更改堆的默认性质，即将最大堆更改为最小堆

1)代码演示make_heap()[最大堆]的用法 (1) Code to demonstrate use of make_heap()[max heap])

#include <bits/stdc++.h>
using namespace std;
#define MAX 5
int main()
{int array[MAX]={6,3,6,17,8};
//Max Heap created
make_heap(array,array+MAX);
cout<<array[0]<<endl;
return 0;
}

Output

输出量

17

2)代码演示make_heap()[最小堆]的用法 (2) Code to demonstrate use of make_heap()[min heap])

#include <bits/stdc++.h>
using namespace std;
#define MAX 5
bool compare(int a, int b)
{if(a<b)
return 0; //change to 1 if max heap required
else
return 1; //change to 0 if max heap required
}
int main()
{int array[MAX]={6,3,6,17,8};
make_heap(array,array+MAX,compare);
cout<<array[0]<<endl;
return 0;
}

Output

输出量

3

翻译自: https://www.includehelp.com/stl/create-Heap-by-using-make-heap.aspx

stl make_heap