1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
<html lang="en">
<head>
<title>Sorting - GNU Scientific Library -- Reference Manual</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="GNU Scientific Library -- Reference Manual">
<meta name="generator" content="makeinfo 4.8">
<link title="Top" rel="start" href="index.html#Top">
<link rel="prev" href="Combinations.html" title="Combinations">
<link rel="next" href="BLAS-Support.html" title="BLAS Support">
<link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
<!--
Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007 The GSL Team.
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.2 or
any later version published by the Free Software Foundation; with the
Invariant Sections being ``GNU General Public License'' and ``Free Software
Needs Free Documentation'', the Front-Cover text being ``A GNU Manual'',
and with the Back-Cover Text being (a) (see below). A copy of the
license is included in the section entitled ``GNU Free Documentation
License''.
(a) The Back-Cover Text is: ``You have freedom to copy and modify this
GNU Manual, like GNU software.''-->
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
pre.display { font-family:inherit }
pre.format { font-family:inherit }
pre.smalldisplay { font-family:inherit; font-size:smaller }
pre.smallformat { font-family:inherit; font-size:smaller }
pre.smallexample { font-size:smaller }
pre.smalllisp { font-size:smaller }
span.sc { font-variant:small-caps }
span.roman { font-family:serif; font-weight:normal; }
span.sansserif { font-family:sans-serif; font-weight:normal; }
--></style>
</head>
<body>
<div class="node">
<p>
<a name="Sorting"></a>
Next: <a rel="next" accesskey="n" href="BLAS-Support.html">BLAS Support</a>,
Previous: <a rel="previous" accesskey="p" href="Combinations.html">Combinations</a>,
Up: <a rel="up" accesskey="u" href="index.html#Top">Top</a>
<hr>
</div>
<h2 class="chapter">11 Sorting</h2>
<p><a name="index-sorting-1050"></a><a name="index-heapsort-1051"></a>This chapter describes functions for sorting data, both directly and
indirectly (using an index). All the functions use the <dfn>heapsort</dfn>
algorithm. Heapsort is an O(N \log N) algorithm which operates
in-place and does not require any additional storage. It also provides
consistent performance, the running time for its worst-case (ordered
data) being not significantly longer than the average and best cases.
Note that the heapsort algorithm does not preserve the relative ordering
of equal elements—it is an <dfn>unstable</dfn> sort. However the resulting
order of equal elements will be consistent across different platforms
when using these functions.
<ul class="menu">
<li><a accesskey="1" href="Sorting-objects.html">Sorting objects</a>
<li><a accesskey="2" href="Sorting-vectors.html">Sorting vectors</a>
<li><a accesskey="3" href="Selecting-the-k-smallest-or-largest-elements.html">Selecting the k smallest or largest elements</a>
<li><a accesskey="4" href="Computing-the-rank.html">Computing the rank</a>
<li><a accesskey="5" href="Sorting-Examples.html">Sorting Examples</a>
<li><a accesskey="6" href="Sorting-References-and-Further-Reading.html">Sorting References and Further Reading</a>
</ul>
<hr>The GNU Scientific Library - a free numerical library licensed under the GNU GPL<br>Back to the <a href="/software/gsl/">GNU Scientific Library Homepage</a></body></html>
|
