Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
ARTICLES Fortran 90 & 95 Linked List Operations: Managing an Ordered List with Pointers to Pointers Loren P. Meissner 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. 1. An item in the linked list with a matching key may be found. In this case, the new item will not be inserted but it may be desirable to modify the matching item. When the search terminates, the target of the "traveling node pointer" Trav_NP is the node with a matching key. 2. If all items in the list have keys smaller than the new one, the end of the linked list will be reached. In this case, Trav_NP is null when the search terminates. The new item is to be inserted at the end, as the new successor of the previous target of Trav_NP. 3. Otherwise, the search terminates when an item with a larger
ACM SIGPLAN Fortran Forum – Association for Computing Machinery
Published: Aug 1, 1997
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.