上传cppreference
This commit is contained in:
242
web/cppreference-zh/chmhelp/cpp-algorithm-partition.html
Normal file
242
web/cppreference-zh/chmhelp/cpp-algorithm-partition.html
Normal file
@@ -0,0 +1,242 @@
|
||||
<!DOCTYPE html>
|
||||
<html lang="zh" dir="ltr" class="client-nojs" xmlns="http://www.w3.org/1999/xhtml" xml:lang="zh">
|
||||
<head><meta http-equiv="x-ua-compatible" content="ie=edge">
|
||||
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
|
||||
<title>std::partition</title>
|
||||
<link rel="stylesheet" href="ext.css" />
|
||||
<link rel="stylesheet" href="site_modules.css" />
|
||||
</head>
|
||||
<body class="mediawiki ltr sitedir-ltr ns-0 ns-subject page-cpp_algorithm_partition skin-cppreference2 action-view cpp-navbar">
|
||||
<div id="cpp-content-base">
|
||||
<div id="content"><a id="top"></a>
|
||||
<h1 id="firstHeading" class="firstHeading"><span style="font-size:0.7em; line-height:130%">std::</span>partition</h1>
|
||||
<div id="bodyContent">
|
||||
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-algorithm.html">algorithm</a></span></div>
|
||||
<div id="mw-content-text" lang="zh" dir="ltr" class="mw-content-ltr" xml:lang="zh">
|
||||
<table class="t-dcl-begin">
|
||||
<tbody>
|
||||
<tr class="t-dsc-header">
|
||||
<td>
|
||||
<div>定义于头文件 <code><a href="cpp-header-algorithm.html"><algorithm></a></code></div>
|
||||
</td>
|
||||
<td></td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</tbody>
|
||||
<tbody class="t-dcl-rev t-dcl-rev-num">
|
||||
<tr class="t-dcl-rev-aux">
|
||||
<td></td>
|
||||
<td rowspan="142">(1)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
<tr class="t-dcl t-until-cxx11">
|
||||
<td>
|
||||
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> BidirIt, <span class="kw1">class</span> UnaryPredicate <span class="sy1">></span><br />
|
||||
BidirIt partition<span class="br0">(</span> BidirIt first, BidirIt last, UnaryPredicate p <span class="br0">)</span><span class="sy4">;</span></span></div>
|
||||
</td>
|
||||
<td class="t-dcl-nopad"></td>
|
||||
<td><span class="t-mark-rev t-until-cxx11">(C++11 前)</span></td>
|
||||
</tr>
|
||||
<tr class="t-dcl t-since-cxx11 t-until-cxx20">
|
||||
<td>
|
||||
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> ForwardIt, <span class="kw1">class</span> UnaryPredicate <span class="sy1">></span><br />
|
||||
ForwardIt partition<span class="br0">(</span> ForwardIt first, ForwardIt last, UnaryPredicate p <span class="br0">)</span><span class="sy4">;</span></span></div>
|
||||
</td>
|
||||
<td class="t-dcl-nopad"></td>
|
||||
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span><br />
|
||||
<span class="t-mark-rev t-until-cxx20">(C++20 前)</span></td>
|
||||
</tr>
|
||||
<tr class="t-dcl t-since-cxx20">
|
||||
<td>
|
||||
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> ForwardIt, <span class="kw1">class</span> UnaryPredicate <span class="sy1">></span><br />
|
||||
<span class="kw4">constexpr</span> ForwardIt partition<span class="br0">(</span> ForwardIt first, ForwardIt last, UnaryPredicate p <span class="br0">)</span><span class="sy4">;</span></span></div>
|
||||
</td>
|
||||
<td class="t-dcl-nopad"></td>
|
||||
<td><span class="t-mark-rev t-since-cxx20">(C++20 起)</span></td>
|
||||
</tr>
|
||||
</tbody>
|
||||
<tbody>
|
||||
<tr class="t-dcl t-since-cxx17">
|
||||
<td>
|
||||
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> ExecutionPolicy, <span class="kw1">class</span> ForwardIt, <span class="kw1">class</span> UnaryPredicate <span class="sy1">></span><br /></span>
|
||||
<p>ForwardIt partition<span class="br0">(</span> ExecutionPolicy<span class="sy3">&&</span> policy,<br /></p>
|
||||
ForwardIt first, ForwardIt last, UnaryPredicate p <span class="br0">)</span><span class="sy4">;</span></div>
|
||||
</td>
|
||||
<td>(2)</td>
|
||||
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
||||
</tr>
|
||||
<tr class="t-dcl-sep">
|
||||
<td></td>
|
||||
<td></td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
<div class="t-li1"><span class="t-li">1)</span> 重排序范围 <code>[first, last)</code> 中的元素，使得谓词 <code>p</code> 对其返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> 的元素前于谓词 <code>p</code> 对其返回 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">false</span></span></span> 的元素。不保持相对顺序。</div>
|
||||
<div class="t-li1"><span class="t-li">2)</span> 同 <span class="t-v">(1)</span> ，但按照 <code>policy</code> 执行。此重载仅若 <span class="t-rev-inl t-until-cxx20"><span><span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-is_execution_policy.html"><span class="kw1564">std::<span class="me2">is_execution_policy_v</span></span></a><span class="sy1"><</span><a href="cpp-types-decay.html"><span class="kw629">std::<span class="me2">decay_t</span></span></a><span class="sy1"><</span>ExecutionPolicy<span class="sy1">>></span></span></span></span> <span><span class="t-mark-rev t-until-cxx20">(C++20 前)</span></span></span><span class="t-rev-inl t-since-cxx20"><span><span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-algorithm-is_execution_policy.html"><span class="kw1564">std::<span class="me2">is_execution_policy_v</span></span></a><span class="sy1"><</span>std<span class="sy4">::</span><span class="me2">remove_cvref_t</span><span class="sy1"><</span>ExecutionPolicy<span class="sy1">>></span></span></span></span> <span><span class="t-mark-rev t-since-cxx20">(C++20 起)</span></span></span> 为 true 才参与重载决议。</div>
|
||||
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">参数</span></h3>
|
||||
<table class="t-par-begin">
|
||||
<tr class="t-par">
|
||||
<td>first, last</td>
|
||||
<td>-</td>
|
||||
<td>要重排序的元素范围</td>
|
||||
</tr>
|
||||
<tr class="t-par">
|
||||
<td>policy</td>
|
||||
<td>-</td>
|
||||
<td>所用的执行策略。细节见<a href="cpp-algorithm-execution_policy_tag_t.html">执行策略</a>。</td>
|
||||
</tr>
|
||||
<tr class="t-par">
|
||||
<td>p</td>
|
||||
<td>-</td>
|
||||
<td>若元素应在顺序中先于其他元素则返回 ​<span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw2">true</span></span></span> 的一元谓词。<br />
|
||||
<p>对每个（可为 const 的） <code>VT</code> 类型参数 <code>v</code> ，其中 <code>VT</code> 是 <code>ForwardIt</code> 的值类型，表达式 <span class="t-c"><span class="mw-geshi cpp source-cpp">p<span class="br0">(</span>v<span class="br0">)</span></span></span> 必须可转换为 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw4">bool</span></span></span> ，无关乎<a href="cpp-language-value_category.html">值类别</a>，而且必须不修改 <code>v</code> 。从而不允许 <span class="t-c"><span class="mw-geshi cpp source-cpp">VT<span class="sy3">&</span></span></span> 类型参数<span class="t-rev-inl t-since-cxx11"><span>，亦不允许 <span class="t-c"><span class="mw-geshi cpp source-cpp">VT</span></span> ，除非对 <code>VT</code> 而言移动等价于复制</span> <span><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></span></span>。 ​</p>
|
||||
</td>
|
||||
</tr>
|
||||
<tr class="t-par-hitem">
|
||||
<td colspan="3">类型要求</td>
|
||||
</tr>
|
||||
<tr class="t-par-req">
|
||||
<td colspan="3">-
|
||||
<div class="spacer"></div>
|
||||
<code>BidirIt</code> 必须满足<a href="cpp-named_req-BidirectionalIterator.html"><span style="font-style:italic">老式双向迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyBidirectionalIterator)</span></a> 的要求。</td>
|
||||
</tr>
|
||||
<tr class="t-par-req">
|
||||
<td colspan="3">-
|
||||
<div class="spacer"></div>
|
||||
<code>ForwardIt</code> 必须满足<a href="cpp-named_req-ValueSwappable.html"><span style="font-style:italic">值可交换</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(ValueSwappable)</span></a> 和 <a href="cpp-named_req-ForwardIterator.html"><span style="font-style:italic">老式向前迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyForwardIterator)</span></a> 的要求。然而，若 <code>ForwardIt</code> 亦满足<a href="cpp-named_req-BidirectionalIterator.html"><span style="font-style:italic">老式双向迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyBidirectionalIterator)</span></a> 的要求则操作更高效</td>
|
||||
</tr>
|
||||
<tr class="t-par-req">
|
||||
<td colspan="3">-
|
||||
<div class="spacer"></div>
|
||||
<code>UnaryPredicate</code> 必须满足<a href="cpp-named_req-Predicate.html"><span style="font-style:italic">谓词</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Predicate)</span></a> 的要求。</td>
|
||||
</tr>
|
||||
</table>
|
||||
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
||||
<p>指向第二组元素首元素的迭代器。</p>
|
||||
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
||||
<p>给定 N = <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first,last<span class="br0">)</span></span></span> ，</p>
|
||||
<div class="t-li1"><span class="t-li">1)</span> 准确 N 次应用谓词。若 <code>ForwardIt</code> 满足<a href="cpp-named_req-BidirectionalIterator.html"><span style="font-style:italic">老式双向迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyBidirectionalIterator)</span></a> 的要求则至多交换 N/2 次，否则至多交换 N 次。</div>
|
||||
<div class="t-li1"><span class="t-li">2)</span> <code>O(N log N)</code> 次交换，及 <code>O(N)</code> 次应用谓词。</div>
|
||||
<h3><span class="mw-headline" id=".E5.BC.82.E5.B8.B8">异常</span></h3>
|
||||
<p>拥有名为 <code>ExecutionPolicy</code> 的模板形参的重载按下列方式报告错误：</p>
|
||||
<ul>
|
||||
<li>若作为算法一部分调用的函数的执行抛出异常，且 <code>ExecutionPolicy</code> 为<a href="cpp-algorithm-execution_policy_tag_t.html">标准策略</a>之一，则调用 <span class="t-lc"><a href="cpp-error-terminate.html">std::terminate</a></span> 。对于任何其他 <code>ExecutionPolicy</code> ，行为是实现定义的。</li>
|
||||
<li>若算法无法分配内存，则抛出 <span class="t-lc"><a href="cpp-memory-new-bad_alloc.html">std::bad_alloc</a></span> 。</li>
|
||||
</ul>
|
||||
<h3><span class="mw-headline" id=".E5.8F.AF.E8.83.BD.E7.9A.84.E5.AE.9E.E7.8E.B0">可能的实现</span></h3>
|
||||
<table class="eq-fun-cpp-table">
|
||||
<tr>
|
||||
<td>
|
||||
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
||||
<div class="cpp source-cpp">
|
||||
<pre class="de1"><span class="kw1">template</span><span class="sy1"><</span><span class="kw1">class</span> ForwardIt, <span class="kw1">class</span> UnaryPredicate<span class="sy1">></span>
|
||||
ForwardIt partition<span class="br0">(</span>ForwardIt first, ForwardIt last, UnaryPredicate p<span class="br0">)</span>
|
||||
<span class="br0">{</span>
|
||||
first <span class="sy1">=</span> <a href="cpp-algorithm-find_if_not.html"><span class="kw1576">std::<span class="me2">find_if_not</span></span></a><span class="br0">(</span>first, last, p<span class="br0">)</span><span class="sy4">;</span>
|
||||
<span class="kw1">if</span> <span class="br0">(</span>first <span class="sy1">==</span> last<span class="br0">)</span> <span class="kw1">return</span> first<span class="sy4">;</span>
|
||||
|
||||
<span class="kw1">for</span> <span class="br0">(</span>ForwardIt i <span class="sy1">=</span> <a href="cpp-iterator-next.html"><span class="kw674">std::<span class="me2">next</span></span></a><span class="br0">(</span>first<span class="br0">)</span><span class="sy4">;</span> i <span class="sy3">!</span><span class="sy1">=</span> last<span class="sy4">;</span> <span class="sy2">++</span>i<span class="br0">)</span> <span class="br0">{</span>
|
||||
<span class="kw1">if</span> <span class="br0">(</span>p<span class="br0">(</span><span class="sy2">*</span>i<span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span>
|
||||
<a href="cpp-algorithm-iter_swap.html"><span class="kw1601">std::<span class="me2">iter_swap</span></span></a><span class="br0">(</span>i, first<span class="br0">)</span><span class="sy4">;</span>
|
||||
<span class="sy2">++</span>first<span class="sy4">;</span>
|
||||
<span class="br0">}</span>
|
||||
<span class="br0">}</span>
|
||||
<span class="kw1">return</span> first<span class="sy4">;</span>
|
||||
<span class="br0">}</span></pre></div>
|
||||
</div>
|
||||
</td>
|
||||
</tr>
|
||||
</table>
|
||||
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
|
||||
<div class="t-example">
|
||||
<div class="t-example-live-link"></div>
|
||||
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
||||
<div class="cpp source-cpp">
|
||||
<pre class="de1"><span class="co2">#include <algorithm></span>
|
||||
<span class="co2">#include <iostream></span>
|
||||
<span class="co2">#include <iterator></span>
|
||||
<span class="co2">#include <vector></span>
|
||||
<span class="co2">#include <forward_list></span>
|
||||
|
||||
<span class="kw1">template</span> <span class="sy1"><</span><span class="kw1">class</span> ForwardIt<span class="sy1">></span>
|
||||
<span class="kw4">void</span> quicksort<span class="br0">(</span>ForwardIt first, ForwardIt last<span class="br0">)</span>
|
||||
<span class="br0">{</span>
|
||||
<span class="kw1">if</span><span class="br0">(</span>first <span class="sy1">==</span> last<span class="br0">)</span> <span class="kw1">return</span><span class="sy4">;</span>
|
||||
<span class="kw4">auto</span> pivot <span class="sy1">=</span> <span class="sy2">*</span><a href="cpp-iterator-next.html"><span class="kw674">std::<span class="me2">next</span></span></a><span class="br0">(</span>first, <a href="cpp-iterator-distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first,last<span class="br0">)</span><span class="sy2">/</span><span class="nu0">2</span><span class="br0">)</span><span class="sy4">;</span>
|
||||
ForwardIt middle1 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">partition</span><span class="br0">(</span>first, last,
|
||||
<span class="br0">[</span>pivot<span class="br0">]</span><span class="br0">(</span><span class="kw4">const</span> <span class="kw4">auto</span><span class="sy3">&</span> em<span class="br0">)</span><span class="br0">{</span> <span class="kw1">return</span> em <span class="sy1"><</span> pivot<span class="sy4">;</span> <span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span>
|
||||
ForwardIt middle2 <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">partition</span><span class="br0">(</span>middle1, last,
|
||||
<span class="br0">[</span>pivot<span class="br0">]</span><span class="br0">(</span><span class="kw4">const</span> <span class="kw4">auto</span><span class="sy3">&</span> em<span class="br0">)</span><span class="br0">{</span> <span class="kw1">return</span> <span class="sy3">!</span><span class="br0">(</span>pivot <span class="sy1"><</span> em<span class="br0">)</span><span class="sy4">;</span> <span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span>
|
||||
quicksort<span class="br0">(</span>first, middle1<span class="br0">)</span><span class="sy4">;</span>
|
||||
quicksort<span class="br0">(</span>middle2, last<span class="br0">)</span><span class="sy4">;</span>
|
||||
<span class="br0">}</span>
|
||||
|
||||
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
||||
<span class="br0">{</span>
|
||||
<a href="cpp-container-vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> v <span class="sy1">=</span> <span class="br0">{</span><span class="nu0">0</span>,<span class="nu0">1</span>,<span class="nu0">2</span>,<span class="nu0">3</span>,<span class="nu0">4</span>,<span class="nu0">5</span>,<span class="nu0">6</span>,<span class="nu0">7</span>,<span class="nu0">8</span>,<span class="nu0">9</span><span class="br0">}</span><span class="sy4">;</span>
|
||||
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"Original vector:<span class="es1">\n</span> "</span><span class="sy4">;</span>
|
||||
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">int</span> elem <span class="sy4">:</span> v<span class="br0">)</span>
|
||||
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> elem <span class="sy1"><<</span> <span class="st0">' '</span><span class="sy4">;</span>
|
||||
|
||||
<span class="kw4">auto</span> it <span class="sy1">=</span> std<span class="sy4">::</span><span class="me2">partition</span><span class="br0">(</span>v.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, v.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">int</span> i<span class="br0">)</span><span class="br0">{</span><span class="kw1">return</span> i <span class="sy2">%</span> <span class="nu0">2</span> <span class="sy1">==</span> <span class="nu0">0</span><span class="sy4">;</span><span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span>
|
||||
|
||||
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"<span class="es1">\n</span>Partitioned vector:<span class="es1">\n</span> "</span><span class="sy4">;</span>
|
||||
<a href="cpp-algorithm-copy.html"><span class="kw1582">std::<span class="me2">copy</span></span></a><span class="br0">(</span><a href="cpp-iterator-begin.html"><span class="kw676">std::<span class="me2">begin</span></span></a><span class="br0">(</span>v<span class="br0">)</span>, it, <a href="cpp-iterator-ostream_iterator.html"><span class="kw670">std::<span class="me2">ostream_iterator</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span><span class="br0">(</span><a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a>, <span class="st0">" "</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
||||
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">" * "</span><span class="sy4">;</span>
|
||||
<a href="cpp-algorithm-copy.html"><span class="kw1582">std::<span class="me2">copy</span></span></a><span class="br0">(</span>it, <a href="cpp-iterator-end.html"><span class="kw680">std::<span class="me2">end</span></span></a><span class="br0">(</span>v<span class="br0">)</span>, <a href="cpp-iterator-ostream_iterator.html"><span class="kw670">std::<span class="me2">ostream_iterator</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span><span class="br0">(</span><a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a>, <span class="st0">" "</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
||||
|
||||
<a href="cpp-container-forward_list.html"><span class="kw1273">std::<span class="me2">forward_list</span></span></a><span class="sy1"><</span><span class="kw4">int</span><span class="sy1">></span> fl <span class="sy1">=</span> <span class="br0">{</span><span class="nu0">1</span>, <span class="nu0">30</span>, <span class="sy2">-</span><span class="nu0">4</span>, <span class="nu0">3</span>, <span class="nu0">5</span>, <span class="sy2">-</span><span class="nu0">4</span>, <span class="nu0">1</span>, <span class="nu0">6</span>, <span class="sy2">-</span><span class="nu0">8</span>, <span class="nu0">2</span>, <span class="sy2">-</span><span class="nu0">5</span>, <span class="nu0">64</span>, <span class="nu0">1</span>, <span class="nu0">92</span><span class="br0">}</span><span class="sy4">;</span>
|
||||
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"<span class="es1">\n</span>Unsorted list:<span class="es1">\n</span> "</span><span class="sy4">;</span>
|
||||
<span class="kw1">for</span> <span class="br0">(</span><span class="kw4">int</span> n <span class="sy4">:</span> fl<span class="br0">)</span>
|
||||
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> n <span class="sy1"><<</span> <span class="st0">' '</span><span class="sy4">;</span>
|
||||
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
||||
|
||||
quicksort<span class="br0">(</span><a href="cpp-iterator-begin.html"><span class="kw676">std::<span class="me2">begin</span></span></a><span class="br0">(</span>fl<span class="br0">)</span>, <a href="cpp-iterator-end.html"><span class="kw680">std::<span class="me2">end</span></span></a><span class="br0">(</span>fl<span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
||||
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"Sorted using quicksort:<span class="es1">\n</span> "</span><span class="sy4">;</span>
|
||||
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">int</span> fi <span class="sy4">:</span> fl<span class="br0">)</span> <a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> fi <span class="sy1"><<</span> <span class="st0">' '</span><span class="sy4">;</span>
|
||||
<a href="cpp-io-cout.html"><span class="kw1757">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
||||
<span class="br0">}</span></pre></div>
|
||||
</div>
|
||||
<p>输出：</p>
|
||||
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
||||
<div class="text source-text">
|
||||
<pre class="de1">Original vector:
|
||||
0 1 2 3 4 5 6 7 8 9
|
||||
Partitioned vector:
|
||||
0 8 2 6 4 * 5 3 7 1 9
|
||||
Unsorted list:
|
||||
1 30 -4 3 5 -4 1 6 -8 2 -5 64 1 92
|
||||
Sorted using quicksort:
|
||||
-8 -5 -4 -4 1 1 1 2 3 5 6 30 64 92</pre></div>
|
||||
</div>
|
||||
</div>
|
||||
<h3><span class="mw-headline" id=".E5.8F.82.E9.98.85">参阅</span></h3>
|
||||
<table class="t-dsc-begin">
|
||||
<tr class="t-dsc">
|
||||
<td>
|
||||
<div class="t-dsc-member-div">
|
||||
<div><a href="cpp-algorithm-is_partitioned.html"><span class="t-lines"><span>is_partitioned</span></span></a></div>
|
||||
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
|
||||
</div>
|
||||
</td>
|
||||
<td>判断范围是否已按给定的谓词划分<br />
|
||||
<span class="t-mark">(函数模板)</span></td>
|
||||
</tr>
|
||||
<tr class="t-dsc">
|
||||
<td>
|
||||
<div class="t-dsc-member-div">
|
||||
<div><a href="cpp-algorithm-stable_partition.html"><span class="t-lines"><span>stable_partition</span></span></a></div>
|
||||
</div>
|
||||
</td>
|
||||
<td>将元素分为两组，同时保留其相对顺序<br />
|
||||
<span class="t-mark">(函数模板)</span></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div>
|
||||
<div class="visualClear"></div>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
Reference in New Issue
Block a user