itrimhpsort.F File Reference

#include "implicit_f.inc"

Go to the source code of this file.

Functions/Subroutines
subroutine	itrimhpsort (tab, len)

Function/Subroutine Documentation

itrimhpsort()

subroutine itrimhpsort	(	integer, dimension(len)	tab,
		integer	len )

Definition at line 28 of file itrimhpsort.F.

C-----------------------------------------------
c in place heap sort algorithm of integer table with elimination 
c of double entries. Returns the sorted table and final length.
C-----------------------------------------------
C   I m p l i c i t   T y p e s
C-----------------------------------------------
#include      "implicit_f.inc"
C-----------------------------------------------
C   D u m m y   A r g u m e n t s
C-----------------------------------------------
      INTEGER :: LEN, TAB(LEN)
C-----------------------------------------------
C   L o c a l   V a r i a b l e s
C-----------------------------------------------
      INTEGER I,J,K,L,VAL 
c=======================================================================    
      IF (len < 2) RETURN
      l  = len/2 + 1
      k = len
c
      !The index L will be decremented from its initial value during the
      !"hKing" (heap creation) phase. Once it reaches 1, the index K 
      !will be decremented from its initial value down to 1 during the
      !"retKement-and-promotion" (heap selection) phase.
 
      DO   ! main heap sort loop 
        IF (l > 1)THEN
          l=l-1
          val=tab(l)
        ELSE
          val=tab(k)
          tab(k)=tab(1)
          k=k-1
          IF (k == 1) THEN
            tab(1)=val
            EXIT
          END IF
        END IF
        i=l
        j=l+l
        DO WHILE (j <= k)
          IF(j < k) THEN
            IF (tab(j) < tab(j+1)) j=j+1
          END IF
          IF (val < tab(j)) THEN
            tab(i)=tab(j)
            i=j
            j=j+j
          ELSE
            j=k+1
          END IF
        END DO
        tab(i)=val
      ENDDO  ! main heap sort loop
c
c-----------      
c     eliminate double entries
c-----------      
      j   = 1
      val = tab(1)
      DO i=2,len                
        IF (tab(i) == val) cycle
        val = tab(i)
        j   = j+1                
        tab(j) = val           
      END DO                     
      len = j                 
c-----------      
      RETURN