C C C L S E R C H C C LINEAR SERCH ROUTINE C C THIS ROUTINE USES A LINEAR SEARCH TECHNIQUE TO LOCATE AN ITEM IN A C TABLE . THE ITEMS IN THE TABLE CAN BE ANY LENGTH SPECIFIED, C AND THEY MUST BE CONTIGUOUS( IE. THERE SHOULD NOT BE ANY UNUSED OR C BLANK ITEMS ) . THE ROUTINE SIMPLY COMPARES THE ITEM WITH EACH ENTRY C IN THE TABLE SEQUENTIALLY FROM THE FIRST TO THE LAST.WHEN A MATCH IS C FOUND THE INDEX OF THE ENTRY WHERE A MATCH WAS FOUND IS RETURNED.THE C CALLING SEQUENCE IS: C C CALL LSERCH ( TABLE , SIZE , ITEM , LEN , INDEX ) C C WHERE: C TABLE- INTEGER ARRAY OF VALUES TO BE SEARCHED. ENTRIES C IN THE TABLE NEED NOT BE IN ANY SPECIAL ORDER. C SIZE- INTEGER VARIABLE CONTAINING THE NUMBER OF ENTRIES C IN THE TABLE. C ITEM- INTEGER ARRAY CONTAINING THE ITEM TO BE SEARCHED C FOR. C LEN- INTEGER VARIABLE WHICH CONTAINS THE LENGTH OF THE ITEM C IN BYTES. C INDEX- INTEGER VARIABLE WHICH WILL RETURN THE TABLE INDEX IF A C MATCH IS FOUND.IF THE ITEM IS NOT FOUND THEN INDEX IS C SET TO -1 . C SUBROUTINE LSERCH ( TABLE , SIZE , ITEM , LEN , INDEX ) INTEGER SIZE , INDEX , LEN BYTE ITEM(LEN) , TABLE(LEN,SIZE) IF ( SIZE .LE. 0 ) GO TO 30 DO 20 I=1,SIZE DO 10 J=1,LEN IF (ITEM(J) .NE. TABLE(J,I) ) GO TO 20 10 CONTINUE INDEX = I GO TO 40 20 CONTINUE 30 CONTINUE INDEX=-1 40 CONTINUE D WRITE (4,1) ITEM,INDEX D 1 FORMAT (' LSERCH TRIED FOR ITEM, INDEX ',A1,I6) RETURN END