File: Sorting-vectors.html

package info (click to toggle)
gsl-ref-html 1.10-1
  • links: PTS
  • area: main
  • in suites: lenny
  • size: 4,496 kB
  • ctags: 2,955
  • sloc: makefile: 33
file content (107 lines) | stat: -rw-r--r-- 6,043 bytes parent folder | download
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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
<html lang="en">
<head>
<title>Sorting vectors - 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="up" href="Sorting.html" title="Sorting">
<link rel="prev" href="Sorting-objects.html" title="Sorting objects">
<link rel="next" href="Selecting-the-k-smallest-or-largest-elements.html" title="Selecting the k smallest or largest elements">
<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-vectors"></a>
Next:&nbsp;<a rel="next" accesskey="n" href="Selecting-the-k-smallest-or-largest-elements.html">Selecting the k smallest or largest elements</a>,
Previous:&nbsp;<a rel="previous" accesskey="p" href="Sorting-objects.html">Sorting objects</a>,
Up:&nbsp;<a rel="up" accesskey="u" href="Sorting.html">Sorting</a>
<hr>
</div>

<h3 class="section">11.2 Sorting vectors</h3>

<p>The following functions will sort the elements of an array or vector,
either directly or indirectly.  They are defined for all real and integer
types using the normal suffix rules.  For example, the <code>float</code>
versions of the array functions are <code>gsl_sort_float</code> and
<code>gsl_sort_float_index</code>.  The corresponding vector functions are
<code>gsl_sort_vector_float</code> and <code>gsl_sort_vector_float_index</code>.  The
prototypes are available in the header files <samp><span class="file">gsl_sort_float.h</span></samp>
<samp><span class="file">gsl_sort_vector_float.h</span></samp>.  The complete set of prototypes can be
included using the header files <samp><span class="file">gsl_sort.h</span></samp> and
<samp><span class="file">gsl_sort_vector.h</span></samp>.

   <p>There are no functions for sorting complex arrays or vectors, since the
ordering of complex numbers is not uniquely defined.  To sort a complex
vector by magnitude compute a real vector containing the magnitudes
of the complex elements, and sort this vector indirectly.  The resulting
index gives the appropriate ordering of the original complex vector.

   <p><a name="index-sorting-vector-elements-1056"></a><a name="index-vector_002c-sorting-elements-of-1057"></a>

<div class="defun">
&mdash; Function: void <b>gsl_sort</b> (<var>double * data, size_t stride, size_t n</var>)<var><a name="index-gsl_005fsort-1058"></a></var><br>
<blockquote><p>This function sorts the <var>n</var> elements of the array <var>data</var> with
stride <var>stride</var> into ascending numerical order. 
</p></blockquote></div>

<div class="defun">
&mdash; Function: void <b>gsl_sort_vector</b> (<var>gsl_vector * v</var>)<var><a name="index-gsl_005fsort_005fvector-1059"></a></var><br>
<blockquote><p>This function sorts the elements of the vector <var>v</var> into ascending
numerical order. 
</p></blockquote></div>

   <p><a name="index-indirect-sorting_002c-of-vector-elements-1060"></a>

<div class="defun">
&mdash; Function: void <b>gsl_sort_index</b> (<var>size_t * p, const double * data, size_t stride, size_t n</var>)<var><a name="index-gsl_005fsort_005findex-1061"></a></var><br>
<blockquote><p>This function indirectly sorts the <var>n</var> elements of the array
<var>data</var> with stride <var>stride</var> into ascending order, storing the
resulting permutation in <var>p</var>.  The array <var>p</var> must be allocated with
a sufficient length to store the <var>n</var> elements of the permutation. 
The elements of <var>p</var> give the index of the array element which would
have been stored in that position if the array had been sorted in place. 
The array <var>data</var> is not changed. 
</p></blockquote></div>

<div class="defun">
&mdash; Function: int <b>gsl_sort_vector_index</b> (<var>gsl_permutation * p, const gsl_vector * v</var>)<var><a name="index-gsl_005fsort_005fvector_005findex-1062"></a></var><br>
<blockquote><p>This function indirectly sorts the elements of the vector <var>v</var> into
ascending order, storing the resulting permutation in <var>p</var>.  The
elements of <var>p</var> give the index of the vector element which would
have been stored in that position if the vector had been sorted in
place.  The first element of <var>p</var> gives the index of the least element
in <var>v</var>, and the last element of <var>p</var> gives the index of the
greatest element in <var>v</var>.  The vector <var>v</var> is not changed. 
</p></blockquote></div>

<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>