Searching A LINK LIST

LIST Is Sorted:  

Algorithm:  SRCHSL(INFO, LINK, START, ITEM, LOC)

LIST is a Sorted list in memory. This algorithm finds the location LOC of the node where ITEM first appears in LIST, or sets LOC = NULL.

1.   Set PTR: = START

2.  Repeat Step 3 while PTR != NULL:

3.   If ITEM < INFO[PTR], then:

    

        Set PTR : = LINK[PTR].     [PTR now points to the next node.]

Else if ITEM = INFO[PTR], then:

Set LOC : = PTR, and Exit.     [Search is successful.]

Else:

Set LOC : = NULL, and Exit.      [ITEM now exceeds INFO[PTR].] 

    [End of If Structure]

[End of Step 2 loop]

4.   Set LOC : = NULL.

5.Exit