📄 sort_heap.html
字号:
<HTML><!-- -- Copyright (c) 1996-1999 -- Silicon Graphics Computer Systems, Inc. -- -- Permission to use, copy, modify, distribute and sell this software -- and its documentation for any purpose is hereby granted without fee, -- provided that the above copyright notice appears in all copies and -- that both that copyright notice and this permission notice appear -- in supporting documentation. Silicon Graphics makes no -- representations about the suitability of this software for any -- purpose. It is provided "as is" without express or implied warranty. -- -- Copyright (c) 1994 -- Hewlett-Packard Company -- -- Permission to use, copy, modify, distribute and sell this software -- and its documentation for any purpose is hereby granted without fee, -- provided that the above copyright notice appears in all copies and -- that both that copyright notice and this permission notice appear -- in supporting documentation. Hewlett-Packard Company makes no -- representations about the suitability of this software for any -- purpose. It is provided "as is" without express or implied warranty. -- --><Head><Title>sort_heap</Title><!-- Generated by htmldoc --></HEAD><BODY TEXT="#000000" LINK="#006600" ALINK="#003300" VLINK="#7C7F87" BGCOLOR="#FFFFFF"><A HREF="/"><IMG SRC="/images/common/sgilogo_small.gif" ALT="SGI Logo" WIDTH="80" HEIGHT="72" BORDER="0"></A><P><!--end header--><BR Clear><H1>sort_heap</H1><Table CellPadding=0 CellSpacing=0 width=100%><TR><TD Align=left><Img src = "algorithms.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD><TD Align=right><Img src = "function.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD></TR><TR><TD Align=left VAlign=top><b>Category</b>: algorithms</TD><TD Align=right VAlign=top><b>Component type</b>: function</TD></TR></Table><h3>Prototype</h3><tt>Sort_heap</tt> is an overloaded name; there are actually two <tt>sort_heap</tt> functions. <pre>template <class <A href="RandomAccessIterator.html">RandomAccessIterator</A>>void sort_heap(RandomAccessIterator first, RandomAccessIterator last);template <class <A href="RandomAccessIterator.html">RandomAccessIterator</A>, class <A href="StrictWeakOrdering.html">StrictWeakOrdering</A>>void sort_heap(RandomAccessIterator first, RandomAccessIterator last, StrictWeakOrdering comp);</pre> <h3>Description</h3><tt>Sort_heap</tt> turns a heap <A href="#1">[1]</A> <tt>[first, last)</tt> into a sorted range. Note that this is not a stable sort: the relative order of equivalentelements is not guaranteed to be preserved.<P>The two versions of <tt>sort_heap</tt> differ in how they define whether oneelement is less than another. The first version comparesobjects using <tt>operator<</tt>, and the second compares objects usinga <A href="functors.html">function object</A> <tt>comp</tt>.<h3>Definition</h3>Defined in the standard header <A href="algorithm">algorithm</A>, and in the nonstandardbackward-compatibility header <A href="algo.h">algo.h</A>.<h3>Requirements on types</h3>For the first version, the one that takes two arguments:<UL><LI><tt>RandomAccessIterator</tt> is a model of <A href="RandomAccessIterator.html">Random Access Iterator</A>.<LI><tt>RandomAccessIterator</tt> is mutable.<LI><tt>RandomAccessIterator</tt>'s value type is a model of <A href="LessThanComparable.html">LessThan Comparable</A>.<LI>The ordering on objects of <tt>RandomAccessIterator</tt>'s value type is a <i>strict weak ordering</i>, as defined in the <A href="LessThanComparable.html">LessThan Comparable</A> requirements.</UL>For the second version, the one that takes three arguments:<UL><LI><tt>RandomAccessIterator</tt> is a model of <A href="RandomAccessIterator.html">Random Access Iterator</A>.<LI><tt>RandomAccessIterator</tt> is mutable.<LI><tt>StrictWeakOrdering</tt> is a model of <A href="StrictWeakOrdering.html">Strict Weak Ordering</A>.<LI><tt>RandomAccessIterator</tt>'s value type is convertible to <tt>StrictWeakOrdering</tt>'s argument type.</UL><h3>Preconditions</h3>For the first version, the one that takes two arguments:<UL><LI><tt>[first, last)</tt> is a valid range.<LI><tt>[first, last)</tt> is a heap. That is, <tt><A href="is_heap.html">is_heap</A>(first, last)</tt> is <tt>true</tt>.</UL>For the second version, the one that takes three arguments:<UL><LI><tt>[first, last)</tt> is a valid range.<LI><tt>[first, last)</tt> is a heap. That is, <tt><A href="is_heap.html">is_heap</A>(first, last, comp)</tt> is <tt>true</tt>.</UL><h3>Complexity</h3>At most <tt>N * log(N)</tt> comparisons, where <tt>N</tt> is <tt>last - first</tt>.<h3>Example</h3><pre>int main(){ int A[] = {1, 4, 2, 8, 5, 7}; const int N = sizeof(A) / sizeof(int); <A href="make_heap.html">make_heap</A>(A, A+N); <A href="copy.html">copy</A>(A, A+N, <A href="ostream_iterator.html">ostream_iterator</A><int>(cout, " ")); cout << endl; sort_heap(A, A+N); <A href="copy.html">copy</A>(A, A+N, <A href="ostream_iterator.html">ostream_iterator</A><int>(cout, " ")); cout << endl;}</pre><h3>Notes</h3><P><A name="1">[1]</A>A heap is a particular way of ordering the elements in a range of<A href="RandomAccessIterator.html">Random Access Iterators</A> <tt>[f, l)</tt>. The reason heaps are useful(especially for sorting, or as priority queues) is that they satisfytwo important properties. First, <tt>*f</tt> is the largest element in theheap. Second, it is possible to add an element to a heap (using<tt>push_heap</tt>), or to remove <tt>*f</tt>, in logarithmic time.Internally, a heap is a tree represented as a sequential range.The tree is constructed so that that eachnode is less than or equal to its parent node.<h3>See also</h3><tt><A href="push_heap.html">push_heap</A></tt>, <tt><A href="pop_heap.html">pop_heap</A></tt>, <tt><A href="make_heap.html">make_heap</A></tt>, <tt><A href="is_heap.html">is_heap</A></tt>, <tt><A href="sort.html">sort</A></tt>,<tt><A href="stable_sort.html">stable_sort</A></tt>,<tt><A href="partial_sort.html">partial_sort</A></tt>,<tt><A href="partial_sort_copy.html">partial_sort_copy</A></tt><!-- start footer --><!-- Footer Begins --><STYLE TYPE="text/css"><!--TD.footer, TD.footer A{ font-family: Arial, helvetica, sans-serif; font-size: 8pt;}A.home {font-family: Arial, helvetica, sans-serif;}--></STYLE><P><A CLASS="home" HREF="index.html">STL Home</A><P><TABLE WIDTH="600" CELLPADDING="0" CELLPADDING="0" BORDER="0"> <TR> <TD ALIGN="RIGHT" CLASS="footer"><A HREF="/company_info/terms.html" TARGET="_top">terms of use</A> | <A HREF="/company_info/privacy.html" TARGET="_top">privacy policy</A></TD> <TD ALIGN="CENTER" CLASS="footer"> | </TD> <TD ALIGN="LEFT" CLASS="footer"><A HREF="/cgi-bin/feedback/" TARGET="_top">contact us</A></TD> </TR><TR> <TD ALIGN="RIGHT" CLASS="footer">Copyright © 1993-2003 Silicon Graphics, Inc. All rights reserved.</TD> <TD ALIGN="CENTER" CLASS="footer"> | </TD> <TD ALIGN="LEFT" CLASS="footer"><A HREF="/company_info/trademarks/" TARGET="_top">Trademark Information</A></TD> </TR></TABLE><!-- Footer Ends --><!-- end footer --><P></BODY></HTML> ⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -