dichotomic_search_i_asc.F File Reference

#include "implicit_f.inc"

Go to the source code of this file.

Functions/Subroutines
integer function	dichotomic_search_i_asc (val, array, len)

Function/Subroutine Documentation

dichotomic_search_i_asc()

integer function dichotomic_search_i_asc	(	integer, intent(in)	val,
		integer, dimension(len), intent(in)	array,
		integer, intent(in)	len )

Definition at line 26 of file dichotomic_search_i_asc.F.

C-----------------------------------------------
C   D e s c r i p t i o n
C-----------------------------------------------
C This subroutines is searching and returning the index in integer array ARRAY(1:LEN)
C such as ARRAY(index)<= VAL <ARRAY(index)
C Dichotomic search is used
C-----------------------------------------------
C   P r e c o n d i t i on
C-----------------------------------------------
C ARRAY(1:LEN) must be sorted integers (ascending order)
C LEN >= 1
C VAL is an integer
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, INTENT(IN) :: VAL
        INTEGER, INTENT(IN) :: LEN
        INTEGER, INTENT(IN) :: ARRAY(LEN)
        INTEGER :: DICHOTOMIC_SEARCH_I_ASC
C-----------------------------------------------
C   L o c a l   V a r i a b l e s
C-----------------------------------------------
        INTEGER :: IMID,ISTART,IEND
C-----------------------------------------------
C   S o u r c e   L i n e s
C-----------------------------------------------
        istart = 1
        iend = len
        !VAL ABOVE UPPER BOUND
        IF(array(1)>val)THEN
          dichotomic_search_i_asc = 1
          RETURN
        ENDIF
        !VAL LOWER THAN LOWER BOUND
        IF(array(len)<val)THEN
          dichotomic_search_i_asc = len
          RETURN
        ENDIF
        !VAL IS BETWEEN THE BOUNDS
        DO WHILE (istart+1<iend)
          imid=(iend+istart)/2
          IF(array(imid) > val)THEN
            !FOCUS ON LEFT PART
            iend = imid
          ELSEIF(array(imid) < val)THEN
            !FOCUS ON RIGHT PART
            istart = imid
          ELSE
            !FOUND BY CHANCE NO NEED TO ITERATE MORE
            dichotomic_search_i_asc = imid
            RETURN
          ENDIF
        ENDDO
        dichotomic_search_i_asc = istart
        RETURN