<!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>
sort [C++ Reference]
</title>
<meta name="generator" content="DokuWiki Release 2009-12-25c "Lemming"" />
<meta name="robots" content="index,follow" />
<meta name="date" content="2009-10-10T08:29:00-0700" />
<meta name="keywords" content="stl,list,sort" />
<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/list/sort?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:list" />
<link rel="edit" title="Edit this page" href="/wiki/stl/list/sort?do=edit" />
<link rel="alternate" type="text/html" title="Plain HTML" href="/wiki/_export/xhtml/stl/list/sort" />
<link rel="alternate" type="text/plain" title="Wiki Markup" href="/wiki/_export/raw/stl/list/sort" />
<link rel="canonical" href="http://www.cppreference.com/wiki/stl/list/sort" />
<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:list';var JSINFO = {"id":"stl:list:sort","namespace":"stl:list"};
//--><!]]></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/list/start.html" title="stl:list:start">C++ Lists</a> » <a href="../../stl/list/sort.html" title="stl:list:sort">sort</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="sort" id="sort">sort</a></h2>
<div class="level2">
<p>
Syntax:
</p>
<pre class="c code c++" style="font-family:monospace;"> <span class="co2">#include <list></span>
<span class="kw4">void</span> sort<span class="br0">(</span><span class="br0">)</span><span class="sy0">;</span>
<span class="kw4">void</span> sort<span class="br0">(</span> BinPred p <span class="br0">)</span><span class="sy0">;</span></pre>
<p>
The sort() function is used to sort lists into ascending order. Ordering is
done via the < operator, unless p is specified, in which case it is used to
determine if an element is less than another.
</p>
<p>
Sorting takes N log N time.
</p>
<p>
Related Topics: <a href="../../stl/list/reverse.html" class="wikilink1" title="stl:list:reverse">reverse</a>
</p>
<pre class="c code c++" style="font-family:monospace;">Simple example code<span class="sy0">:</span>
<span class="co2">#include <iostream></span>
<span class="co2">#include <list></span>
using namespace std<span class="sy0">;</span>
<span class="co1">// Assumes TYPE t; cout << t; is valid.</span>
template<span class="sy0"><</span>class TYPE<span class="sy0">></span>
<span class="kw2">inline</span> ostream <span class="sy0">&</span> operator<span class="sy0"><<</span> <span class="br0">(</span> ostream <span class="sy0">&</span> theOstream<span class="sy0">,</span>
<span class="kw4">const</span> list<span class="sy0"><</span>TYPE<span class="sy0">></span> <span class="sy0">&</span> theList <span class="br0">)</span>
<span class="br0">{</span>
typename list<span class="sy0"><</span>TYPE<span class="sy0">>::</span><span class="me2">const_iterator</span> listIterator <span class="sy0">=</span> theList.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span><span class="sy0">;</span>
<span class="kw1">for</span> <span class="br0">(</span> <span class="kw4">int</span> i <span class="sy0">=</span> <span class="nu0">0</span><span class="sy0">;</span> listIterator <span class="sy0">!=</span> theList.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="sy0">;</span> <span class="sy0">++</span>listIterator<span class="sy0">,</span> i <span class="sy0">++</span> <span class="br0">)</span>
theOstream <span class="sy0"><<</span> <span class="st0">" ["</span> <span class="sy0"><<</span> i <span class="sy0"><<</span> <span class="st0">"]: <span class="es1">\"</span>"</span> <span class="sy0"><<</span> <span class="br0">(</span><span class="sy0">*</span>listIterator<span class="br0">)</span> <span class="sy0"><<</span> <span class="st0">"<span class="es1">\"</span>"</span> <span class="sy0"><<</span> endl<span class="sy0">;</span>
<span class="kw1">return</span> theOstream<span class="sy0">;</span>
<span class="br0">}</span>
<span class="kw4">struct</span> Functor
<span class="br0">{</span>
bool operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span> <span class="kw4">const</span> <span class="kw4">char</span> <span class="sy0">*</span> a<span class="sy0">,</span> <span class="kw4">const</span> <span class="kw4">char</span> <span class="sy0">*</span> b <span class="br0">)</span>
<span class="br0">{</span> <span class="kw1">return</span> strcmp<span class="br0">(</span>a<span class="sy0">,</span>b<span class="br0">)</span> <span class="sy0"><</span> <span class="nu0">0</span><span class="sy0">;</span> <span class="br0">}</span>
<span class="br0">}</span><span class="sy0">;</span>
<span class="kw4">int</span>
main<span class="br0">(</span><span class="br0">)</span>
<span class="br0">{</span>
list<span class="sy0"><</span>char<span class="sy0">*></span> l<span class="sy0">;</span>
<span class="coMULTI">/* Load up some example test data... */</span>
<span class="kw4">char</span> s<span class="br0">[</span>3<span class="br0">]</span><span class="sy0">;</span>
s<span class="br0">[</span><span class="nu0">2</span><span class="br0">]</span> <span class="sy0">=</span> <span class="st0">'<span class="es5">\0</span>'</span><span class="sy0">;</span>
<span class="kw1">for</span> <span class="br0">(</span> s<span class="br0">[</span><span class="nu0">0</span><span class="br0">]</span><span class="sy0">=</span><span class="st0">'c'</span><span class="sy0">;</span> s<span class="br0">[</span><span class="nu0">0</span><span class="br0">]</span><span class="sy0">>=</span><span class="st0">'a'</span><span class="sy0">;</span> s<span class="br0">[</span>0<span class="br0">]</span><span class="sy0">--</span> <span class="br0">)</span>
<span class="kw1">for</span> <span class="br0">(</span> s<span class="br0">[</span><span class="nu0">1</span><span class="br0">]</span><span class="sy0">=</span><span class="st0">'c'</span><span class="sy0">;</span> s<span class="br0">[</span><span class="nu0">1</span><span class="br0">]</span><span class="sy0">>=</span><span class="st0">'a'</span><span class="sy0">;</span> s<span class="br0">[</span>1<span class="br0">]</span><span class="sy0">--</span> <span class="br0">)</span>
l.<span class="me1">push_back</span><span class="br0">(</span>strdup<span class="br0">(</span>s<span class="br0">)</span><span class="br0">)</span><span class="sy0">;</span>
<span class="coMULTI">/* Show us that test data... */</span>
<a href="http://www.opengroup.org/onlinepubs/009695399/functions/cout.html"><span class="kw3">cout</span></a> <span class="sy0"><<</span> l <span class="sy0"><<</span> endl<span class="sy0">;</span>
<span class="coMULTI">/* Sort list. */</span>
Functor f<span class="sy0">;</span>
l.<span class="me1">sort</span><span class="br0">(</span>f<span class="br0">)</span><span class="sy0">;</span>
<span class="coMULTI">/* Show us what we have now... */</span>
<a href="http://www.opengroup.org/onlinepubs/009695399/functions/cout.html"><span class="kw3">cout</span></a> <span class="sy0"><<</span> l <span class="sy0"><<</span> endl<span class="sy0">;</span>
<span class="br0">}</span></pre>
</div>
<!-- wikipage stop -->
</div>
<div class="clearer"> </div>
<div class="stylefoot">
<div class="meta">
<div class="user">
</div>
<!--
<div class="doc">
stl/list/sort.txt · Last modified: 10/10/2009 08:29 by 124.255.102.233 </div>
-->
</div>
</div></div></body>
</html>