Fortran 90 & 95 linked list operations
Loren P. Meissner · ACM SIGPLAN Fortran Forum · 1997
adapted from Fortran 90 & 95 Array and Pointer Techniques, Section 5.4 (See page 25 below) Suppose that a linked list is arranged in increasing order according to a key, and a new item that is a candidate for insertion has been generated.A linear search for the new key, beginning at the root of the linked list, has three possible outcomes.