You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
98 lines
2.8 KiB
98 lines
2.8 KiB
2 years ago
|
C Copyright(C) 1999-2020 National Technology & Engineering Solutions
|
||
|
|
C of Sandia, LLC (NTESS). Under the terms of Contract DE-NA0003525 with
|
||
|
|
C NTESS, the U.S. Government retains certain rights in this software.
|
||
|
|
C
|
||
|
|
C See packages/seacas/LICENSE for details
|
||
|
|
|
||
|
|
SUBROUTINE SORTST(N, ARRIN, ITOPP, IBOTP, IRANGE, INDX)
|
||
|
|
C***********************************************************************
|
||
|
|
|
||
|
|
C SUBROUTINE SORTST = THIS SUBROUTINE SORTS A REAL ARRAY IN ASCENDING
|
||
|
|
C ORDER AND DOES IT JUST CHANGING THE INDEX ARRAY.
|
||
|
|
|
||
|
|
C***********************************************************************
|
||
|
|
|
||
|
|
C VARIABLES IN : N ......NUMBER OF ELEMENTS IN THE ARRAY
|
||
|
|
C ARRIN ..REAL ARRAY WITH DATA TO BE SORTED
|
||
|
|
C ITOPP...TOP POINTER IN THE X ARRAY
|
||
|
|
C IBOTP...BOTTOM POINTER IN THE X ARRAY
|
||
|
|
C OUT: INDX ...INDEX ARRAY WITH ITS SORTED VALUES IN
|
||
|
|
C ASCENDING ORDER.
|
||
|
|
C IRANGE..RANGE BETWEEN THE ARRAY 'INDX' WAS SORTED
|
||
|
|
|
||
|
|
C WRITTEN BY: HORACIO RECALDE DATE: JAN 20, 1988
|
||
|
|
C MODIFIED BY: MB STEPHENSON DATA: MAR 08, 1989
|
||
|
|
C REPLACED EXCHANGE SORT WITH HEAPSORT FOR EFFICIENCY
|
||
|
|
C***********************************************************************
|
||
|
|
|
||
|
|
REAL ARRIN(N)
|
||
|
|
INTEGER INDX(N)
|
||
|
|
|
||
|
|
C... CHECK POINTERS
|
||
|
|
|
||
|
|
ITOP = ITOPP
|
||
|
|
IBOT = IBOTP
|
||
|
|
IF (ITOP .GT. N) ITOP = ITOP - N
|
||
|
|
IF (IBOT .GT. N) IBOT = IBOT - N
|
||
|
|
|
||
|
|
C--- CALCULATE THE RANGE AND INITIALIZE INDEX ARRAY
|
||
|
|
|
||
|
|
IF (ITOP .EQ. IBOT) THEN
|
||
|
|
IRANGE = 1
|
||
|
|
INDX(1) = ITOP
|
||
|
|
RETURN
|
||
|
|
ELSE IF (ITOP .LT. IBOT) THEN
|
||
|
|
IRANGE = IBOT - ITOP + 1
|
||
|
|
ELSE
|
||
|
|
IRANGE = IBOT - ITOP + N + 1
|
||
|
|
ENDIF
|
||
|
|
|
||
|
|
DO 100 J = 1, IRANGE
|
||
|
|
INDX(J) = ITOP
|
||
|
|
ITOP = ITOP + 1
|
||
|
|
IF (ITOP .GT. N) ITOP = 1
|
||
|
|
100 CONTINUE
|
||
|
|
|
||
|
|
C--- PERFORM A HEAPSORT ON THE ELEMENTS
|
||
|
|
C (SEE NUMERICAL RECEIPTS, PG. 233)
|
||
|
|
C NOTE: THERE MUST BE AT LEAST 2 ELEMENTS IN THE ARRAY
|
||
|
|
|
||
|
|
L = IRANGE/2 + 1
|
||
|
|
IR = IRANGE
|
||
|
|
110 CONTINUE
|
||
|
|
IF (L .GT. 1) THEN
|
||
|
|
L = L - 1
|
||
|
|
INDXT = INDX(L)
|
||
|
|
Q = ARRIN(INDXT)
|
||
|
|
ELSE
|
||
|
|
INDXT = INDX(IR)
|
||
|
|
Q = ARRIN(INDXT)
|
||
|
|
INDX(IR) = INDX(1)
|
||
|
|
IR = IR - 1
|
||
|
|
IF (IR .EQ. 1) THEN
|
||
|
|
INDX(1) = INDXT
|
||
|
|
RETURN
|
||
|
|
END IF
|
||
|
|
END IF
|
||
|
|
|
||
|
|
I = L
|
||
|
|
J = L + L
|
||
|
|
120 CONTINUE
|
||
|
|
IF (J .LE. IR) THEN
|
||
|
|
IF (J .LT. IR) THEN
|
||
|
|
IF (ARRIN(INDX(J)) .LT. ARRIN(INDX(J + 1))) J = J + 1
|
||
|
|
END IF
|
||
|
|
IF (Q .LT. ARRIN(INDX(J))) THEN
|
||
|
|
INDX(I) = INDX(J)
|
||
|
|
I = J
|
||
|
|
J = J + J
|
||
|
|
ELSE
|
||
|
|
J = IR + 1
|
||
|
|
END IF
|
||
|
|
GO TO 120
|
||
|
|
END IF
|
||
|
|
INDX(I) = INDXT
|
||
|
|
GO TO 110
|
||
|
|
|
||
|
|
END
|