Index Terms
- Fortran 90 & 95 linked list operations: managing an ordered list with pointers to pointers
Recommendations
A generic linked list implementation in Fortran 95
This paper develops a standard conforming generic linked list in Fortran 95 which is capable of storing data of any type. The list is implemented using the transfer intrinsic function, and although the interface is generic, it remains relatively simple ...
Fortran 90 pointers vs. “Cray” pointers
The Fortran 77 standard does not contain pointer facilities, but because of heavy user demand, many Fortran 77 compilers have been extended with "Cray" pointers. The demand for pointers in Fortran was heard by the standards committee, X313, and a ...
O(1)-time unsorting by prefix-reversals in a boustrophedon linked list
FUN'10: Proceedings of the 5th international conference on Fun with algorithmsConventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A boustrophedon linked list is a doubly-linked list, except that each node ...
Comments