A nonrecursive list moving algorithm

Edward M. Reingold · Communications of the ACM · 1973

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.

Cited by 7 works. doi:10.1145/362041.362200 Open-access PDF

Authors

References