<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en"
lang="en" dir="ltr">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>
partial_sort_copy [C++ Reference]
</title>
<meta name="generator" content="DokuWiki Release 2009-12-25c "Lemming"" />
<meta name="robots" content="index,follow" />
<meta name="date" content="2010-04-07T05:01:56-0700" />
<meta name="keywords" content="stl,algorithm,partial_sort_copy" />
<link rel="search" type="application/opensearchdescription+xml" href="/wiki/lib/exe/opensearch.php" title="C++ Reference" />
<link rel="start" href="/wiki/" />
<link rel="contents" href="/wiki/stl/algorithm/partial_sort_copy?do=index" title="Index" />
<link rel="alternate" type="application/rss+xml" title="Recent Changes" href="/wiki/feed.php" />
<link rel="alternate" type="application/rss+xml" title="Current Namespace" href="/wiki/feed.php?mode=list&ns=stl:algorithm" />
<link rel="edit" title="Edit this page" href="/wiki/stl/algorithm/partial_sort_copy?do=edit" />
<link rel="alternate" type="text/html" title="Plain HTML" href="/wiki/_export/xhtml/stl/algorithm/partial_sort_copy" />
<link rel="alternate" type="text/plain" title="Wiki Markup" href="/wiki/_export/raw/stl/algorithm/partial_sort_copy" />
<link rel="canonical" href="http://www.cppreference.com/wiki/stl/algorithm/partial_sort_copy" />
<link rel="stylesheet" media="all" type="text/css" href="/wiki/lib/exe/css.php?s=all&t=custom1&tseed=1272971091" />
<link rel="stylesheet" media="screen" type="text/css" href="/wiki/lib/exe/css.php?t=custom1&tseed=1272971091" />
<link rel="stylesheet" media="print" type="text/css" href="/wiki/lib/exe/css.php?s=print&t=custom1&tseed=1272971091" />
<script type="text/javascript" charset="utf-8" ><!--//--><![CDATA[//><!--
var NS='stl:algorithm';var JSINFO = {"id":"stl:algorithm:partial_sort_copy","namespace":"stl:algorithm"};
//--><!]]></script>
<script type="text/javascript" charset="utf-8" src="/wiki/lib/exe/js.php?tseed=1272971091" ></script>
<link rel="shortcut icon" href="/wiki/lib/tpl/custom1/images/favicon.png" />
</head>
<body>
<div class="dokuwiki">
<div class="stylehead">
<div class="breadcrumbs">
<span class="bchead">You are here: </span><a href="../../start.html" title="start">C++ Reference</a> » <a href="../../stl/start.html" title="stl:start">C++ Standard Template Library</a> » <a href="../../stl/algorithm/start.html" title="stl:algorithm:start">C++ Algorithms</a> » <a href="../../stl/algorithm/partial_sort_copy.html" title="stl:algorithm:partial_sort_copy">partial_sort_copy</a> </div>
</div>
<div class="page">
<script src="http://www.google-analytics.com/urchin.js" type="text/javascript">
</script>
<script type="text/javascript">
_uacct = "UA-2828341-1";
urchinTracker();
</script>
<!-- wikipage start -->
<h2><a name="partial_sort_copy" id="partial_sort_copy">partial_sort_copy</a></h2>
<div class="level2">
<p>
Syntax:
</p>
<pre class="c code c++" style="font-family:monospace;"> <span class="co2">#include <algorithm></span>
random_access_iterator partial_sort_copy<span class="br0">(</span> input_iterator start<span class="sy0">,</span> input_iterator end<span class="sy0">,</span> random_access_iterator result_start<span class="sy0">,</span> random_access_iterator result_end <span class="br0">)</span><span class="sy0">;</span>
random_access_iterator partial_sort_copy<span class="br0">(</span> input_iterator start<span class="sy0">,</span> input_iterator end<span class="sy0">,</span> random_access_iterator result_start<span class="sy0">,</span> random_access_iterator result_end<span class="sy0">,</span> StrictWeakOrdering cmp <span class="br0">)</span><span class="sy0">;</span></pre>
<p>
The partial_sort_copy() algorithm behaves like partial_sort(), except that
instead of partially sorting the range in-place, a copy of the range is created
and the sorting takes place in the copy. The initial range is defined by
[start,end) and the location of the copy is defined by
[result_start,result_end).
</p>
<p>
partial_sort_copy() returns an iterator to the end of the copied, partially-
sorted range of elements.
</p>
<p>
Example:
</p>
<pre class="c code c++" style="font-family:monospace;"><span class="co1">// partial_sort_copy example</span>
<span class="co2">#include <iostream></span>
<span class="co2">#include <algorithm></span>
<span class="co2">#include <vector></span>
using namespace std<span class="sy0">;</span>
bool myfunction <span class="br0">(</span><span class="kw4">int</span> i<span class="sy0">,</span><span class="kw4">int</span> j<span class="br0">)</span> <span class="br0">{</span> <span class="kw1">return</span> <span class="br0">(</span>i<span class="sy0"><</span>j<span class="br0">)</span><span class="sy0">;</span> <span class="br0">}</span>
<span class="kw4">int</span> main <span class="br0">(</span><span class="br0">)</span> <span class="br0">{</span>
<span class="kw4">int</span> myints<span class="br0">[</span><span class="br0">]</span> <span class="sy0">=</span> <span class="br0">{</span>9<span class="sy0">,</span>8<span class="sy0">,</span>7<span class="sy0">,</span>6<span class="sy0">,</span>5<span class="sy0">,</span>4<span class="sy0">,</span>3<span class="sy0">,</span>2<span class="sy0">,</span>1<span class="br0">}</span><span class="sy0">;</span>
vector<span class="sy0"><</span>int<span class="sy0">></span> myvector <span class="br0">(</span>5<span class="br0">)</span><span class="sy0">;</span>
vector<span class="sy0"><</span>int<span class="sy0">>::</span><span class="me2">iterator</span> it<span class="sy0">;</span>
<span class="co1">// using default comparison (operator <):</span>
partial_sort_copy <span class="br0">(</span>myints<span class="sy0">,</span> myints<span class="sy0">+</span>9<span class="sy0">,</span> myvector.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="sy0">,</span> myvector.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy0">;</span>
<span class="co1">// using function as comp</span>
partial_sort_copy <span class="br0">(</span>myints<span class="sy0">,</span> myints<span class="sy0">+</span>9<span class="sy0">,</span> myvector.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="sy0">,</span> myvector.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="sy0">,</span> myfunction<span class="br0">)</span><span class="sy0">;</span>
<span class="co1">// print out content:</span>
<a href="http://www.opengroup.org/onlinepubs/009695399/functions/cout.html"><span class="kw3">cout</span></a> <span class="sy0"><<</span> <span class="st0">"myvector contains:"</span><span class="sy0">;</span>
<span class="kw1">for</span> <span class="br0">(</span>it<span class="sy0">=</span>myvector.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="sy0">;</span> it<span class="sy0">!=</span>myvector.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="sy0">;</span> <span class="sy0">++</span>it<span class="br0">)</span>
<a href="http://www.opengroup.org/onlinepubs/009695399/functions/cout.html"><span class="kw3">cout</span></a> <span class="sy0"><<</span> <span class="st0">" "</span> <span class="sy0"><<</span> <span class="sy0">*</span>it<span class="sy0">;</span>
<a href="http://www.opengroup.org/onlinepubs/009695399/functions/cout.html"><span class="kw3">cout</span></a> <span class="sy0"><<</span> endl<span class="sy0">;</span>
<span class="kw1">return</span> <span class="nu0">0</span><span class="sy0">;</span>
<span class="br0">}</span></pre>
<p>
Output:
myvector contains: 1 2 3 4 5
</p>
<p>
Related Topics: <a href="../../stl/algorithm/binary_search.html" class="wikilink1" title="stl:algorithm:binary_search">binary_search</a>, <a href="../../stl/algorithm/is_sorted.html" class="wikilink2" title="stl:algorithm:is_sorted" rel="nofollow">is_sorted</a>, <a href="../../stl/algorithm/partial_sort.html" class="wikilink1" title="stl:algorithm:partial_sort">partial_sort</a>, <a href="../../stl/algorithm/sort.html" class="wikilink1" title="stl:algorithm:sort">sort</a>, <a href="../../stl/algorithm/stable_sort.html" class="wikilink1" title="stl:algorithm:stable_sort">stable_sort</a>
</p>
</div>
<!-- wikipage stop -->
</div>
<div class="clearer"> </div>
<div class="stylefoot">
<div class="meta">
<div class="user">
</div>
<!--
<div class="doc">
stl/algorithm/partial_sort_copy.txt · Last modified: 04/07/2010 05:01 by 60.191.2.238 </div>
-->
</div>
</div></div></body>
</html>