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
|
---
:name: slasrt
:md5sum: 15c8d51a595bb1c0feca7da2d1cd0147
:category: :subroutine
:arguments:
- id:
:type: char
:intent: input
- n:
:type: integer
:intent: input
- d:
:type: real
:intent: input/output
:dims:
- n
- info:
:type: integer
:intent: output
:substitutions: {}
:fortran_help: " SUBROUTINE SLASRT( ID, N, D, INFO )\n\n\
* Purpose\n\
* =======\n\
*\n\
* Sort the numbers in D in increasing order (if ID = 'I') or\n\
* in decreasing order (if ID = 'D' ).\n\
*\n\
* Use Quick Sort, reverting to Insertion sort on arrays of\n\
* size <= 20. Dimension of STACK limits N to about 2**32.\n\
*\n\n\
* Arguments\n\
* =========\n\
*\n\
* ID (input) CHARACTER*1\n\
* = 'I': sort D in increasing order;\n\
* = 'D': sort D in decreasing order.\n\
*\n\
* N (input) INTEGER\n\
* The length of the array D.\n\
*\n\
* D (input/output) REAL array, dimension (N)\n\
* On entry, the array to be sorted.\n\
* On exit, D has been sorted into increasing order\n\
* (D(1) <= ... <= D(N) ) or into decreasing order\n\
* (D(1) >= ... >= D(N) ), depending on ID.\n\
*\n\
* INFO (output) INTEGER\n\
* = 0: successful exit\n\
* < 0: if INFO = -i, the i-th argument had an illegal value\n\
*\n\n\
* =====================================================================\n\
*\n"
|
