Home → Magazine Archive → September 1971 (Vol. 14, No. 9) → Comment on Cheney's list-compaction algorithm → Abstract

Comment on Cheney's list-compaction algorithm

By Robert R. Fenichel

Communications of the ACM, Vol. 14 No. 9, Pages 603-604
10.1145/362663.362754



C.J. Cheney [2] implicitly assumes that cells of list storage are self-identifying. Cheney needs this assumption so that his algorithm, when linearly scanning the memory containing a copy of a list, can determine whether particular bit patterns within that memory are pointers to other list structure. The assumption is strong, and its effect is contrary to that of the list compaction which is his algorithm's purpose.

The full text of this article is premium content

0 Comments

No entries found