Use of the push_heap() function in the C++

[Gaauge]

I like to do the the programming .in C++ language. I had learned the C++ language in the BSC-IT. I can know the actual concept or working of the C++ functions. So, I want to know what is the push_heap() function of the C++ language. I also want to know what is the use of the push_heap() function in the C++ programming. Can anyone knows about the push_heap() function of C++ language.

[Reegan]

The push_heap() function of the C++ language can be used to add an element that can be defined as the end element before end into a heap that can be defined as the range of an elements that can be in between the range [strt,''end-1). If an object of the weak sequencing comparison function that can be given then it can be used in place of the "<" operator to compare an elements. The push_heap() function can be executed in logarithmic time.

[opaper]

The push_heap() function can given a heap range such as [fst,lst-1), the push_heap() function that can extends the range that can be considered a heap to the range [fst,lst) by placing the value in (lst-1) in its relevant place in it. The following can be the syntax of the push_heap() function in C++ language :

template <class RndmAcesItrtr>
  void push_heap ( RndmAcesItrtr fst, RndmAcesItrtr lst );

[Praetor]

I can suggest you that to carefully go through the following code of lines that can demonstrates you how to use the push_heap() function in the C++ programming as follows :

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main ()
 {
  int mit[] = {10,20,30,5,15};
  vector<int> z(mit,mit+5);
  vector<int>::iterator it;
  make_heap (z.begin(), z.end());
  cout << "initial max heap   : " << z.front() << endl;
  pop_heap (z.begin(), z.end()); z.pop_back();
  cout << "max heap after pop : " << z.front() << endl;
  z.push_back(99); push_heap (z.begin(), z.end());
  cout << "max heap after push: " << z.front() << endl;
  sort_heap (z.begin(),z.end());
  cout << "final sorted range :";
  for (unsigned j=0; j<z.size(); j++) cout << " " << z[j];
  cout << endl;
  return 0;
}

Output:

initial max heap   : 30
max heap after pop : 20
max heap after push: 99
final sorted range : 5 10 15 20 99

[MindSpace]

The following can be the general syntax of the push_heap() function in the C++ language :
1. cmp : This parameters of the push_heap() function can contains an object of the comparison function that can taking two values of the similar type than those that can contained in the given range.
2. fst, lst : These parameters of the push_heap() function can contains the random access iterators to the final and starting positions of the newer heap including an element that can be pushed. The range used can be as [fst,lst).

[Modifier]

Here can be the one more example on the push_heap() function of the C++ language and the following program can help's you to learn the push_heap() function :

#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <numeric>
template <class S>
inline void PRNTELMNTS (const S& cl, const char* otcstr="")
{
    typename S::const_iterator pos;
    std::cout << otcstr;
    for (p=cl.begin(); p!=cl.end(); ++p)
    {
        std::cout << *p << ' ';
    }
    std::cout << std::endl;
}
template <class S>
inline void INSRTELMNTS (S& cl, int fst, int lst)
{
    for (int a=fst; a<=lst; ++a) 
    {
        cl.insert(cl.end(),a);
    }
}
using namespace std;
int main()
{
    vector<int> cl;
    INSRTELMNTS(cl,3,7);
    INSRTELMNTS(cl,5,9);
    INSRTELMNTS(cl,1,4);
    PRNTELMNTS (cl, "on entry:           ");
    cl.push_back (17);
    push_heap (cl.begin(), cl.end());
    PRNTELMNTS (cl, "after push_heap():  ");
}

OUTPUT :

on entry:           3 4 5 6 7 5 6 7 8 9 1 2 3 4
after push_heap():  17 8 9 7 7 5 6 3 6 4 1 2 3 4 5