| 1 |
C Copyright(C) 1999-2020 National Technology & Engineering Solutions |
| 2 |
C of Sandia, LLC (NTESS). Under the terms of Contract DE-NA0003525 with |
| 3 |
C NTESS, the U.S. Government retains certain rights in this software. |
| 4 |
C |
| 5 |
C See packages/seacas/LICENSE for details |
| 6 |
|
| 7 |
SUBROUTINE SORTST(N, ARRIN, ITOPP, IBOTP, IRANGE, INDX) |
| 8 |
C*********************************************************************** |
| 9 |
|
| 10 |
C SUBROUTINE SORTST = THIS SUBROUTINE SORTS A REAL ARRAY IN ASCENDING |
| 11 |
C ORDER AND DOES IT JUST CHANGING THE INDEX ARRAY. |
| 12 |
|
| 13 |
C*********************************************************************** |
| 14 |
|
| 15 |
C VARIABLES IN : N ......NUMBER OF ELEMENTS IN THE ARRAY |
| 16 |
C ARRIN ..REAL ARRAY WITH DATA TO BE SORTED |
| 17 |
C ITOPP...TOP POINTER IN THE X ARRAY |
| 18 |
C IBOTP...BOTTOM POINTER IN THE X ARRAY |
| 19 |
C OUT: INDX ...INDEX ARRAY WITH ITS SORTED VALUES IN |
| 20 |
C ASCENDING ORDER. |
| 21 |
C IRANGE..RANGE BETWEEN THE ARRAY 'INDX' WAS SORTED |
| 22 |
|
| 23 |
C WRITTEN BY: HORACIO RECALDE DATE: JAN 20, 1988 |
| 24 |
C MODIFIED BY: MB STEPHENSON DATA: MAR 08, 1989 |
| 25 |
C REPLACED EXCHANGE SORT WITH HEAPSORT FOR EFFICIENCY |
| 26 |
C*********************************************************************** |
| 27 |
|
| 28 |
REAL ARRIN(N) |
| 29 |
INTEGER INDX(N) |
| 30 |
|
| 31 |
C... CHECK POINTERS |
| 32 |
|
| 33 |
ITOP = ITOPP |
| 34 |
IBOT = IBOTP |
| 35 |
IF (ITOP .GT. N) ITOP = ITOP - N |
| 36 |
IF (IBOT .GT. N) IBOT = IBOT - N |
| 37 |
|
| 38 |
C--- CALCULATE THE RANGE AND INITIALIZE INDEX ARRAY |
| 39 |
|
| 40 |
IF (ITOP .EQ. IBOT) THEN |
| 41 |
IRANGE = 1 |
| 42 |
INDX(1) = ITOP |
| 43 |
RETURN |
| 44 |
ELSE IF (ITOP .LT. IBOT) THEN |
| 45 |
IRANGE = IBOT - ITOP + 1 |
| 46 |
ELSE |
| 47 |
IRANGE = IBOT - ITOP + N + 1 |
| 48 |
ENDIF |
| 49 |
|
| 50 |
DO 100 J = 1, IRANGE |
| 51 |
INDX(J) = ITOP |
| 52 |
ITOP = ITOP + 1 |
| 53 |
IF (ITOP .GT. N) ITOP = 1 |
| 54 |
100 CONTINUE |
| 55 |
|
| 56 |
C--- PERFORM A HEAPSORT ON THE ELEMENTS |
| 57 |
C (SEE NUMERICAL RECEIPTS, PG. 233) |
| 58 |
C NOTE: THERE MUST BE AT LEAST 2 ELEMENTS IN THE ARRAY |
| 59 |
|
| 60 |
L = IRANGE/2 + 1 |
| 61 |
IR = IRANGE |
| 62 |
110 CONTINUE |
| 63 |
IF (L .GT. 1) THEN |
| 64 |
L = L - 1 |
| 65 |
INDXT = INDX(L) |
| 66 |
Q = ARRIN(INDXT) |
| 67 |
ELSE |
| 68 |
INDXT = INDX(IR) |
| 69 |
Q = ARRIN(INDXT) |
| 70 |
INDX(IR) = INDX(1) |
| 71 |
IR = IR - 1 |
| 72 |
IF (IR .EQ. 1) THEN |
| 73 |
INDX(1) = INDXT |
| 74 |
RETURN |
| 75 |
END IF |
| 76 |
END IF |
| 77 |
|
| 78 |
I = L |
| 79 |
J = L + L |
| 80 |
120 CONTINUE |
| 81 |
IF (J .LE. IR) THEN |
| 82 |
IF (J .LT. IR) THEN |
| 83 |
IF (ARRIN(INDX(J)) .LT. ARRIN(INDX(J + 1))) J = J + 1 |
| 84 |
END IF |
| 85 |
IF (Q .LT. ARRIN(INDX(J))) THEN |
| 86 |
INDX(I) = INDX(J) |
| 87 |
I = J |
| 88 |
J = J + J |
| 89 |
ELSE |
| 90 |
J = IR + 1 |
| 91 |
END IF |
| 92 |
GO TO 120 |
| 93 |
END IF |
| 94 |
INDX(I) = INDXT |
| 95 |
GO TO 110 |
| 96 |
|
| 97 |
END |