<!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>
C++ Algorithms [C++ Reference]
</title>
<meta name="generator" content="DokuWiki Release 2009-12-25c "Lemming"" />
<meta name="robots" content="index,follow" />
<meta name="date" content="2010-01-19T05:29:18-0800" />
<meta name="keywords" content="stl,algorithm,start" />
<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/start?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/start?do=edit" />
<link rel="alternate" type="text/html" title="Plain HTML" href="/wiki/_export/xhtml/stl/algorithm/start" />
<link rel="alternate" type="text/plain" title="Wiki Markup" href="/wiki/_export/raw/stl/algorithm/start" />
<link rel="canonical" href="http://www.cppreference.com/wiki/stl/algorithm/start" />
<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:start","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="header">
<div class="pagename">
[[<a href="../../stl/algorithm/start.html" title="Backlinks">C++ Algorithms</a>]]
</div>
<div class="logo">
<a href="http://www.cppreference.com" name="dokuwiki__top" id="dokuwiki__top" accesskey="h" title="[ALT+H]">C++ Reference</a> </div>
<div class="clearer"></div>
</div>
<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> </div>
</div>
<div class="plugin_translation"><span>Translations of this page<sup><a href="../../localization.html" class="wikilink1" title="localization">?</a></sup>:</span> <ul> <li><div class="li"><span class="curid"><a href="../../stl/algorithm/start.html" class="wikilink1" title="stl:algorithm:start">en</a></span></div></li> <li><div class="li"><a href="../../br-pt/stl/algorithm/start.html" class="wikilink2" title="br-pt:stl:algorithm:start" rel="nofollow">br-pt</a></div></li> <li><div class="li"><a href="../../cn/stl/algorithm/start.html" class="wikilink2" title="cn:stl:algorithm:start" rel="nofollow">cn</a></div></li> <li><div class="li"><a href="../../cz/stl/algorithm/start.html" class="wikilink2" title="cz:stl:algorithm:start" rel="nofollow">cz</a></div></li> <li><div class="li"><a href="../../de/stl/algorithm/start.html" class="wikilink2" title="de:stl:algorithm:start" rel="nofollow">de</a></div></li> <li><div class="li"><a href="../../es/stl/algorithm/start.html" class="wikilink1" title="es:stl:algorithm:start">es</a></div></li> <li><div class="li"><a href="../../fr/stl/algorithm/start.html" class="wikilink1" title="fr:stl:algorithm:start">fr</a></div></li> <li><div class="li"><a href="../../it/stl/algorithm/start.html" class="wikilink2" title="it:stl:algorithm:start" rel="nofollow">it</a></div></li> <li><div class="li"><a href="../../jp/stl/algorithm/start.html" class="wikilink1" title="jp:stl:algorithm:start">jp</a></div></li> <li><div class="li"><a href="../../nl/stl/algorithm/start.html" class="wikilink2" title="nl:stl:algorithm:start" rel="nofollow">nl</a></div></li> <li><div class="li"><a href="../../pl/stl/algorithm/start.html" class="wikilink2" title="pl:stl:algorithm:start" rel="nofollow">pl</a></div></li> <li><div class="li"><a href="../../ro/stl/algorithm/start.html" class="wikilink2" title="ro:stl:algorithm:start" rel="nofollow">ro</a></div></li> <li><div class="li"><a href="../../ru/stl/algorithm/start.html" class="wikilink2" title="ru:stl:algorithm:start" rel="nofollow">ru</a></div></li> <li><div class="li"><a href="../../sk/stl/algorithm/start.html" class="wikilink2" title="sk:stl:algorithm:start" rel="nofollow">sk</a></div></li> <li><div class="li"><a href="../../tr/stl/algorithm/start.html" class="wikilink2" title="tr:stl:algorithm:start" rel="nofollow">tr</a></div></li> <li><div class="li"><a href="../../tw/stl/algorithm/start.html" class="wikilink2" title="tw:stl:algorithm:start" rel="nofollow">tw</a></div></li></ul></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 -->
<h1><a name="c_algorithms" id="c_algorithms">C++ Algorithms</a></h1>
<div class="level1">
<p>
The following functions are defined in <algorithm> or <numeric>
, and are part of the std namespace.
</p>
<table class="inline">
<tr class="row0">
<td class="col0"><a href="../../stl/algorithm/accumulate.html" class="wikilink1" title="stl:algorithm:accumulate">accumulate</a></td><td class="col1">sum up a range of elements</td>
</tr>
<tr class="row1">
<td class="col0"><a href="../../stl/algorithm/adjacent_difference.html" class="wikilink1" title="stl:algorithm:adjacent_difference">adjacent_difference</a></td><td class="col1">compute the differences between adjacent elements in a range</td>
</tr>
<tr class="row2">
<td class="col0"><a href="../../stl/algorithm/adjacent_find.html" class="wikilink1" title="stl:algorithm:adjacent_find">adjacent_find</a></td><td class="col1">finds two identical (or some other relationship) items adjacent to each other</td>
</tr>
<tr class="row3">
<td class="col0"><a href="../../stl/algorithm/binary_search.html" class="wikilink1" title="stl:algorithm:binary_search">binary_search</a></td><td class="col1">determine if an element exists in a certain range</td>
</tr>
<tr class="row4">
<td class="col0"><a href="../../stl/algorithm/copy.html" class="wikilink1" title="stl:algorithm:copy">copy</a></td><td class="col1">copy some range of elements to a new location</td>
</tr>
<tr class="row5">
<td class="col0"><a href="../../stl/algorithm/copy_backward.html" class="wikilink1" title="stl:algorithm:copy_backward">copy_backward</a></td><td class="col1">copy a range of elements in backwards order</td>
</tr>
<tr class="row6">
<td class="col0"><a href="../../stl/algorithm/count.html" class="wikilink1" title="stl:algorithm:count">count</a></td><td class="col1">return the number of elements matching a given value</td>
</tr>
<tr class="row7">
<td class="col0"><a href="../../stl/algorithm/count_if.html" class="wikilink1" title="stl:algorithm:count_if">count_if</a></td><td class="col1">return the number of elements for which a predicate is true</td>
</tr>
<tr class="row8">
<td class="col0"><a href="../../stl/algorithm/equal.html" class="wikilink1" title="stl:algorithm:equal">equal</a></td><td class="col1">determine if two sets of elements are the same</td>
</tr>
<tr class="row9">
<td class="col0"><a href="../../stl/algorithm/equal_range.html" class="wikilink1" title="stl:algorithm:equal_range">equal_range</a></td><td class="col1">search for a range of elements that are all equal to a certain element</td>
</tr>
<tr class="row10">
<td class="col0"><a href="../../stl/algorithm/fill.html" class="wikilink1" title="stl:algorithm:fill">fill</a></td><td class="col1">assign a range of elements a certain value</td>
</tr>
<tr class="row11">
<td class="col0"><a href="../../stl/algorithm/fill_n.html" class="wikilink1" title="stl:algorithm:fill_n">fill_n</a></td><td class="col1">assign a value to some number of elements</td>
</tr>
<tr class="row12">
<td class="col0"><a href="../../stl/algorithm/find.html" class="wikilink1" title="stl:algorithm:find">find</a></td><td class="col1">find a value in a given range</td>
</tr>
<tr class="row13">
<td class="col0"><a href="../../stl/algorithm/find_end.html" class="wikilink1" title="stl:algorithm:find_end">find_end</a></td><td class="col1">find the last sequence of elements in a certain range</td>
</tr>
<tr class="row14">
<td class="col0"><a href="../../stl/algorithm/find_first_of.html" class="wikilink1" title="stl:algorithm:find_first_of">find_first_of</a></td><td class="col1">search for any one of a set of elements</td>
</tr>
<tr class="row15">
<td class="col0"><a href="../../stl/algorithm/find_if.html" class="wikilink1" title="stl:algorithm:find_if">find_if</a></td><td class="col1">find the first element for which a certain predicate is true</td>
</tr>
<tr class="row16">
<td class="col0"><a href="../../stl/algorithm/for_each.html" class="wikilink1" title="stl:algorithm:for_each">for_each</a></td><td class="col1">apply a function to a range of elements</td>
</tr>
<tr class="row17">
<td class="col0"><a href="../../stl/algorithm/generate.html" class="wikilink1" title="stl:algorithm:generate">generate</a></td><td class="col1">saves the result of a function in a range</td>
</tr>
<tr class="row18">
<td class="col0"><a href="../../stl/algorithm/generate_n.html" class="wikilink1" title="stl:algorithm:generate_n">generate_n</a></td><td class="col1">saves the result of N applications of a function</td>
</tr>
<tr class="row19">
<td class="col0"><a href="../../stl/algorithm/includes.html" class="wikilink1" title="stl:algorithm:includes">includes</a></td><td class="col1">returns true if one set is a subset of another</td>
</tr>
<tr class="row20">
<td class="col0"><a href="../../stl/algorithm/inner_product.html" class="wikilink1" title="stl:algorithm:inner_product">inner_product</a></td><td class="col1">compute the inner product of two ranges of elements</td>
</tr>
<tr class="row21">
<td class="col0"><a href="../../stl/algorithm/inplace_merge.html" class="wikilink1" title="stl:algorithm:inplace_merge">inplace_merge</a></td><td class="col1">merge two ordered ranges in-place</td>
</tr>
<tr class="row22">
<td class="col0"><a href="../../stl/algorithm/is_heap.html" class="wikilink1" title="stl:algorithm:is_heap">is_heap</a></td><td class="col1">returns true if a given range is a heap</td>
</tr>
<tr class="row23">
<td class="col0"><a href="../../stl/algorithm/iter_swap.html" class="wikilink1" title="stl:algorithm:iter_swap">iter_swap</a></td><td class="col1">swaps the elements pointed to by two iterators</td>
</tr>
<tr class="row24">
<td class="col0"><a href="../../stl/algorithm/lexicographical_compare.html" class="wikilink1" title="stl:algorithm:lexicographical_compare">lexicographical_compare</a></td><td class="col1">returns true if one range is lexicographically less than another</td>
</tr>
<tr class="row25">
<td class="col0"><a href="../../stl/algorithm/lower_bound.html" class="wikilink1" title="stl:algorithm:lower_bound">lower_bound</a></td><td class="col1">search for the first place that a value can be inserted while preserving order</td>
</tr>
<tr class="row26">
<td class="col0"><a href="../../stl/algorithm/make_heap.html" class="wikilink1" title="stl:algorithm:make_heap">make_heap</a></td><td class="col1">creates a heap out of a range of elements</td>
</tr>
<tr class="row27">
<td class="col0"><a href="../../stl/algorithm/max.html" class="wikilink1" title="stl:algorithm:max">max</a></td><td class="col1">returns the larger of two elements</td>
</tr>
<tr class="row28">
<td class="col0"><a href="../../stl/algorithm/max_element.html" class="wikilink1" title="stl:algorithm:max_element">max_element</a></td><td class="col1">returns the largest element in a range</td>
</tr>
<tr class="row29">
<td class="col0"><a href="../../stl/algorithm/merge.html" class="wikilink1" title="stl:algorithm:merge">merge</a></td><td class="col1">merge two sorted ranges</td>
</tr>
<tr class="row30">
<td class="col0"><a href="../../stl/algorithm/min.html" class="wikilink1" title="stl:algorithm:min">min</a></td><td class="col1">returns the smaller of two elements</td>
</tr>
<tr class="row31">
<td class="col0"><a href="../../stl/algorithm/min_element.html" class="wikilink1" title="stl:algorithm:min_element">min_element</a></td><td class="col1">returns the smallest element in a range</td>
</tr>
<tr class="row32">
<td class="col0"><a href="../../stl/algorithm/mismatch.html" class="wikilink1" title="stl:algorithm:mismatch">mismatch</a></td><td class="col1">finds the first position where two ranges differ</td>
</tr>
<tr class="row33">
<td class="col0"><a href="../../stl/algorithm/next_permutation.html" class="wikilink1" title="stl:algorithm:next_permutation">next_permutation</a></td><td class="col1">generates the next greater lexicographic permutation of a range of elements</td>
</tr>
<tr class="row34">
<td class="col0"><a href="../../stl/algorithm/nth_element.html" class="wikilink1" title="stl:algorithm:nth_element">nth_element</a></td><td class="col1">put one element in its sorted location and make sure that no elements to its left are greater than any elements to its right</td>
</tr>
<tr class="row35">
<td class="col0"><a href="../../stl/algorithm/partial_sort.html" class="wikilink1" title="stl:algorithm:partial_sort">partial_sort</a></td><td class="col1">sort the first N elements of a range</td>
</tr>
<tr class="row36">
<td class="col0"><a href="../../stl/algorithm/partial_sort_copy.html" class="wikilink1" title="stl:algorithm:partial_sort_copy">partial_sort_copy</a></td><td class="col1">copy and partially sort a range of elements</td>
</tr>
<tr class="row37">
<td class="col0"><a href="../../stl/algorithm/partial_sum.html" class="wikilink1" title="stl:algorithm:partial_sum">partial_sum</a></td><td class="col1">compute the partial sum of a range of elements</td>
</tr>
<tr class="row38">
<td class="col0"><a href="../../stl/algorithm/partition.html" class="wikilink1" title="stl:algorithm:partition">partition</a></td><td class="col1">divide a range of elements into two groups</td>
</tr>
<tr class="row39">
<td class="col0"><a href="../../stl/algorithm/pop_heap.html" class="wikilink1" title="stl:algorithm:pop_heap">pop_heap</a></td><td class="col1">remove the largest element from a heap</td>
</tr>
<tr class="row40">
<td class="col0"><a href="../../stl/algorithm/prev_permutation.html" class="wikilink1" title="stl:algorithm:prev_permutation">prev_permutation</a></td><td class="col1">generates the next smaller lexicographic permutation of a range of elements</td>
</tr>
<tr class="row41">
<td class="col0"><a href="../../stl/algorithm/push_heap.html" class="wikilink1" title="stl:algorithm:push_heap">push_heap</a></td><td class="col1">add an element to a heap</td>
</tr>
<tr class="row42">
<td class="col0"><a href="../../stl/algorithm/random_shuffle.html" class="wikilink1" title="stl:algorithm:random_shuffle">random_shuffle</a></td><td class="col1">randomly re-order elements in some range</td>
</tr>
<tr class="row43">
<td class="col0"><a href="../../stl/algorithm/remove.html" class="wikilink1" title="stl:algorithm:remove">remove</a></td><td class="col1">remove elements equal to certain value</td>
</tr>
<tr class="row44">
<td class="col0"><a href="../../stl/algorithm/remove_copy.html" class="wikilink1" title="stl:algorithm:remove_copy">remove_copy</a></td><td class="col1">copy a range of elements omitting those that match a certain value</td>
</tr>
<tr class="row45">
<td class="col0"><a href="../../stl/algorithm/remove_copy_if.html" class="wikilink1" title="stl:algorithm:remove_copy_if">remove_copy_if</a></td><td class="col1">create a copy of a range of elements, omitting any for which a predicate is true</td>
</tr>
<tr class="row46">
<td class="col0"><a href="../../stl/algorithm/remove_if.html" class="wikilink1" title="stl:algorithm:remove_if">remove_if</a></td><td class="col1">remove all elements for which a predicate is true</td>
</tr>
<tr class="row47">
<td class="col0"><a href="../../stl/algorithm/replace.html" class="wikilink1" title="stl:algorithm:replace">replace</a></td><td class="col1">replace every occurrence of some value in a range with another value</td>
</tr>
<tr class="row48">
<td class="col0"><a href="../../stl/algorithm/replace_copy.html" class="wikilink1" title="stl:algorithm:replace_copy">replace_copy</a></td><td class="col1">copy a range, replacing certain elements with new ones</td>
</tr>
<tr class="row49">
<td class="col0"><a href="../../stl/algorithm/replace_copy_if.html" class="wikilink1" title="stl:algorithm:replace_copy_if">replace_copy_if</a></td><td class="col1">copy a range of elements, replacing those for which a predicate is true</td>
</tr>
<tr class="row50">
<td class="col0"><a href="../../stl/algorithm/replace_if.html" class="wikilink1" title="stl:algorithm:replace_if">replace_if</a></td><td class="col1">change the values of elements for which a predicate is true</td>
</tr>
<tr class="row51">
<td class="col0"><a href="../../stl/algorithm/reverse.html" class="wikilink1" title="stl:algorithm:reverse">reverse</a></td><td class="col1">reverse elements in some range</td>
</tr>
<tr class="row52">
<td class="col0"><a href="../../stl/algorithm/reverse_copy.html" class="wikilink1" title="stl:algorithm:reverse_copy">reverse_copy</a></td><td class="col1">create a copy of a range that is reversed</td>
</tr>
<tr class="row53">
<td class="col0"><a href="../../stl/algorithm/rotate.html" class="wikilink1" title="stl:algorithm:rotate">rotate</a></td><td class="col1">move the elements in some range to the left by some amount</td>
</tr>
<tr class="row54">
<td class="col0"><a href="../../stl/algorithm/rotate_copy.html" class="wikilink1" title="stl:algorithm:rotate_copy">rotate_copy</a></td><td class="col1">copy and rotate a range of elements</td>
</tr>
<tr class="row55">
<td class="col0"><a href="../../stl/algorithm/search.html" class="wikilink1" title="stl:algorithm:search">search</a></td><td class="col1">search for a range of elements</td>
</tr>
<tr class="row56">
<td class="col0"><a href="../../stl/algorithm/search_n.html" class="wikilink1" title="stl:algorithm:search_n">search_n</a></td><td class="col1">search for N consecutive copies of an element in some range</td>
</tr>
<tr class="row57">
<td class="col0"><a href="../../stl/algorithm/set_difference.html" class="wikilink1" title="stl:algorithm:set_difference">set_difference</a></td><td class="col1">computes the difference between two sets</td>
</tr>
<tr class="row58">
<td class="col0"><a href="../../stl/algorithm/set_intersection.html" class="wikilink1" title="stl:algorithm:set_intersection">set_intersection</a></td><td class="col1">computes the intersection of two sets</td>
</tr>
<tr class="row59">
<td class="col0"><a href="../../stl/algorithm/set_symmetric_difference.html" class="wikilink1" title="stl:algorithm:set_symmetric_difference">set_symmetric_difference</a></td><td class="col1">computes the symmetric difference between two sets</td>
</tr>
<tr class="row60">
<td class="col0"><a href="../../stl/algorithm/set_union.html" class="wikilink1" title="stl:algorithm:set_union">set_union</a></td><td class="col1">computes the union of two sets</td>
</tr>
<tr class="row61">
<td class="col0"><a href="../../stl/algorithm/sort.html" class="wikilink1" title="stl:algorithm:sort">sort</a></td><td class="col1">sort a range into ascending order</td>
</tr>
<tr class="row62">
<td class="col0"><a href="../../stl/algorithm/sort_heap.html" class="wikilink1" title="stl:algorithm:sort_heap">sort_heap</a></td><td class="col1">turns a heap into a sorted range of elements</td>
</tr>
<tr class="row63">
<td class="col0"><a href="../../stl/algorithm/stable_partition.html" class="wikilink1" title="stl:algorithm:stable_partition">stable_partition</a></td><td class="col1">divide elements into two groups while preserving their relative order</td>
</tr>
<tr class="row64">
<td class="col0"><a href="../../stl/algorithm/stable_sort.html" class="wikilink1" title="stl:algorithm:stable_sort">stable_sort</a></td><td class="col1">sort a range of elements while preserving order between equal elements</td>
</tr>
<tr class="row65">
<td class="col0"><a href="../../stl/algorithm/swap.html" class="wikilink1" title="stl:algorithm:swap">swap</a></td><td class="col1">swap the values of two objects</td>
</tr>
<tr class="row66">
<td class="col0"><a href="../../stl/algorithm/swap_ranges.html" class="wikilink1" title="stl:algorithm:swap_ranges">swap_ranges</a></td><td class="col1">swaps two ranges of elements</td>
</tr>
<tr class="row67">
<td class="col0"><a href="../../stl/algorithm/transform.html" class="wikilink1" title="stl:algorithm:transform">transform</a></td><td class="col1">applies a function to a range of elements</td>
</tr>
<tr class="row68">
<td class="col0"><a href="../../stl/algorithm/unique.html" class="wikilink1" title="stl:algorithm:unique">unique</a></td><td class="col1">remove consecutive duplicate elements in a range</td>
</tr>
<tr class="row69">
<td class="col0"><a href="../../stl/algorithm/unique_copy.html" class="wikilink1" title="stl:algorithm:unique_copy">unique_copy</a></td><td class="col1">creates a copy of some range of elements that contains no consecutive duplicates</td>
</tr>
<tr class="row70">
<td class="col0"><a href="../../stl/algorithm/upper_bound.html" class="wikilink1" title="stl:algorithm:upper_bound">upper_bound</a></td><td class="col1">searches for the last place that a value can be inserted while preserving order (first place that is greater than the value)</td>
</tr>
</table>
</div>
<!-- wikipage stop -->
</div>
<div class="clearer"> </div>
<div class="stylefoot">
<div class="meta">
<div class="user">
</div>
<!--
<div class="doc">
stl/algorithm/start.txt · Last modified: 01/19/2010 05:29 by nate </div>
-->
</div>
<div class="bar" id="bar__bottom">
<div class="bar-left" id="bar__bottomleft">
<a href="../../stl/algorithm/start.html" class="action edit" accesskey="e" rel="nofollow">Edit this page</a> •
<a href="../../stl/algorithm/start.html" class="action revisions" accesskey="o" rel="nofollow">Old revisions</a> </div>
<div class="bar-right" id="bar__bottomright">
•
•
•
<a href="../../stl/algorithm/start.html" class="action login" rel="nofollow">Login</a> •
<a href="../../stl/algorithm/start.html" class="action index" accesskey="x" rel="nofollow">Index</a> •
<a href="../../stl/algorithm/start.html" class="action recent" accesskey="r" rel="nofollow">Recent changes</a> •
<a href="../../feed.php.html" title="Recent changes RSS feed">RSS</a> •
<a href='http://creativecommons.org/licenses/by/3.0/us/' title='Creative Commons license'>cc</a> •
<form action="/wiki/" accept-charset="utf-8" class="search" id="dw__search"><div class="no"><input type="hidden" name="do" value="search" /><input type="text" id="qsearch__in" accesskey="f" name="id" class="edit" title="[ALT+F]" /><input type="submit" value="Search" class="button" title="Search" /><div id="qsearch__out" class="ajax_qsearch JSpopup"></div></div></form>
</div>
<div class="clearer"></div>
</div>
</div>
</div>
<div class="no"><img src="/wiki/lib/exe/indexer.php?id=stl%3Aalgorithm%3Astart&1273193085" width="1" height="1" alt="" /></div>
</body>
</html>