Home → Magazine Archive → May 1973 (Vol. 16, No. 5) → A nonrecursive list moving algorithm → Abstract

A nonrecursive list moving algorithm

By Edward M. Reingold

Communications of the ACM, Vol. 16 No. 5, Pages 305-307

Save PDF
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.

The full text of this article is premium content


No entries found