Home → Magazine Archive → April 1972 (Vol. 15, No. 4) → A note on Cheney's nonrecursive list-compacting algorithm → Abstract

A note on Cheney's nonrecursive list-compacting algorithm

By David C. Walden

Communications of the ACM, Vol. 15 No. 4, Page 275

Cheney's list-compacting algorithm [1] goes into an infinite loop when it traces a circular list consisting exclusively of non-items. While it may be reasonable to say that such lists should not exist, it would be very difficult to legislate out of existence programs which illegally create such lists because of bugs, and it would not do for the garbage collector to break down in this instance.

The full text of this article is premium content


No entries found