A nonrecursive list moving algorithm
- 1 May 1973
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 16 (5), 305-307
- https://doi.org/10.1145/362041.362200
Abstract
An efficient, nonrecursive algorithm is given for moving any LISP-type list. In particular, the algorithm requires no storage other than the new nodes into which the lists is to be moved, and no additional bits per node for marking; the algorithm runs in time proportional to the number of nodes in the list. The original list structure is destroyed as it is moved.Keywords
This publication has 2 references indexed in Scilit:
- A nonrecursive list compacting algorithmCommunications of the ACM, 1970
- An efficient machine-independent procedure for garbage collection in various list structuresCommunications of the ACM, 1967