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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
|
/* ../SRC/dsortr.f -- translated by f2c (version 20061008).
You must link the resulting object file with libf2c:
on Microsoft Windows system, link with libf2c.lib;
on Linux or Unix systems, link with .../path/to/libf2c.a -lm
or, if you install libf2c.a in a standard place, with -lf2c -lm
-- in that order, at the end of the command line, as in
cc *.o -lf2c -lm
Source for libf2c is in /netlib/f2c/libf2c.zip, e.g.,
http://www.netlib.org/f2c/libf2c.zip
*/
#include "f2c.h"
/* ----------------------------------------------------------------------- */
/* \BeginDoc */
/* \Name: dsortr */
/* \Description: */
/* Sort the array X1 in the order specified by WHICH and optionally */
/* applies the permutation to the array X2. */
/* \Usage: */
/* call dsortr */
/* ( WHICH, APPLY, N, X1, X2 ) */
/* \Arguments */
/* WHICH Character*2. (Input) */
/* 'LM' -> X1 is sorted into increasing order of magnitude. */
/* 'SM' -> X1 is sorted into decreasing order of magnitude. */
/* 'LA' -> X1 is sorted into increasing order of algebraic. */
/* 'SA' -> X1 is sorted into decreasing order of algebraic. */
/* APPLY Logical. (Input) */
/* APPLY = .TRUE. -> apply the sorted order to X2. */
/* APPLY = .FALSE. -> do not apply the sorted order to X2. */
/* N Integer. (INPUT) */
/* Size of the arrays. */
/* X1 Double precision array of length N. (INPUT/OUTPUT) */
/* The array to be sorted. */
/* X2 Double precision array of length N. (INPUT/OUTPUT) */
/* Only referenced if APPLY = .TRUE. */
/* \EndDoc */
/* ----------------------------------------------------------------------- */
/* \BeginLib */
/* \Author */
/* Danny Sorensen Phuong Vu */
/* Richard Lehoucq CRPC / Rice University */
/* Dept. of Computational & Houston, Texas */
/* Applied Mathematics */
/* Rice University */
/* Houston, Texas */
/* \Revision history: */
/* 12/16/93: Version ' 2.1'. */
/* Adapted from the sort routine in LANSO. */
/* \SCCS Information: @(#) */
/* FILE: sortr.F SID: 2.3 DATE OF SID: 4/19/96 RELEASE: 2 */
/* \EndLib */
/* ----------------------------------------------------------------------- */
/* Subroutine */ int dsortr_(char *which, logical *apply, integer *n,
doublereal *x1, doublereal *x2, ftnlen which_len)
{
/* System generated locals */
integer i__1;
doublereal d__1, d__2;
/* Builtin functions */
integer s_cmp(char *, char *, ftnlen, ftnlen);
/* Local variables */
static integer i__, j, igap;
static doublereal temp;
/* %------------------% */
/* | Scalar Arguments | */
/* %------------------% */
/* %-----------------% */
/* | Array Arguments | */
/* %-----------------% */
/* %---------------% */
/* | Local Scalars | */
/* %---------------% */
/* %-----------------------% */
/* | Executable Statements | */
/* %-----------------------% */
igap = *n / 2;
if (s_cmp(which, "SA", (ftnlen)2, (ftnlen)2) == 0) {
/* X1 is sorted into decreasing order of algebraic. */
L10:
if (igap == 0) {
goto L9000;
}
i__1 = *n - 1;
for (i__ = igap; i__ <= i__1; ++i__) {
j = i__ - igap;
L20:
if (j < 0) {
goto L30;
}
if (x1[j] < x1[j + igap]) {
temp = x1[j];
x1[j] = x1[j + igap];
x1[j + igap] = temp;
if (*apply) {
temp = x2[j];
x2[j] = x2[j + igap];
x2[j + igap] = temp;
}
} else {
goto L30;
}
j -= igap;
goto L20;
L30:
;
}
igap /= 2;
goto L10;
} else if (s_cmp(which, "SM", (ftnlen)2, (ftnlen)2) == 0) {
/* X1 is sorted into decreasing order of magnitude. */
L40:
if (igap == 0) {
goto L9000;
}
i__1 = *n - 1;
for (i__ = igap; i__ <= i__1; ++i__) {
j = i__ - igap;
L50:
if (j < 0) {
goto L60;
}
if ((d__1 = x1[j], abs(d__1)) < (d__2 = x1[j + igap], abs(d__2)))
{
temp = x1[j];
x1[j] = x1[j + igap];
x1[j + igap] = temp;
if (*apply) {
temp = x2[j];
x2[j] = x2[j + igap];
x2[j + igap] = temp;
}
} else {
goto L60;
}
j -= igap;
goto L50;
L60:
;
}
igap /= 2;
goto L40;
} else if (s_cmp(which, "LA", (ftnlen)2, (ftnlen)2) == 0) {
/* X1 is sorted into increasing order of algebraic. */
L70:
if (igap == 0) {
goto L9000;
}
i__1 = *n - 1;
for (i__ = igap; i__ <= i__1; ++i__) {
j = i__ - igap;
L80:
if (j < 0) {
goto L90;
}
if (x1[j] > x1[j + igap]) {
temp = x1[j];
x1[j] = x1[j + igap];
x1[j + igap] = temp;
if (*apply) {
temp = x2[j];
x2[j] = x2[j + igap];
x2[j + igap] = temp;
}
} else {
goto L90;
}
j -= igap;
goto L80;
L90:
;
}
igap /= 2;
goto L70;
} else if (s_cmp(which, "LM", (ftnlen)2, (ftnlen)2) == 0) {
/* X1 is sorted into increasing order of magnitude. */
L100:
if (igap == 0) {
goto L9000;
}
i__1 = *n - 1;
for (i__ = igap; i__ <= i__1; ++i__) {
j = i__ - igap;
L110:
if (j < 0) {
goto L120;
}
if ((d__1 = x1[j], abs(d__1)) > (d__2 = x1[j + igap], abs(d__2)))
{
temp = x1[j];
x1[j] = x1[j + igap];
x1[j + igap] = temp;
if (*apply) {
temp = x2[j];
x2[j] = x2[j + igap];
x2[j + igap] = temp;
}
} else {
goto L120;
}
j -= igap;
goto L110;
L120:
;
}
igap /= 2;
goto L100;
}
L9000:
return 0;
/* %---------------% */
/* | End of dsortr | */
/* %---------------% */
} /* dsortr_ */
|
