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
|
.TH SLASRT l "15 June 2000" "LAPACK version 3.0" ")"
.SH NAME
SLASRT - the numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' )
.SH SYNOPSIS
.TP 19
SUBROUTINE SLASRT(
ID, N, D, INFO )
.TP 19
.ti +4
CHARACTER
ID
.TP 19
.ti +4
INTEGER
INFO, N
.TP 19
.ti +4
REAL
D( * )
.SH PURPOSE
Sort the numbers in D in increasing order (if ID = 'I') or in decreasing order (if ID = 'D' ).
Use Quick Sort, reverting to Insertion sort on arrays of
.br
size <= 20. Dimension of STACK limits N to about 2**32.
.br
.SH ARGUMENTS
.TP 8
ID (input) CHARACTER*1
= 'I': sort D in increasing order;
.br
= 'D': sort D in decreasing order.
.TP 8
N (input) INTEGER
The length of the array D.
.TP 8
D (input/output) REAL array, dimension (N)
On entry, the array to be sorted.
On exit, D has been sorted into increasing order
(D(1) <= ... <= D(N) ) or into decreasing order
(D(1) >= ... >= D(N) ), depending on ID.
.TP 8
INFO (output) INTEGER
= 0: successful exit
.br
< 0: if INFO = -i, the i-th argument had an illegal value
|
