Show simple item record

Destructive Reordering of CDR-Coded Lists

dc.date.accessioned2004-10-01T20:31:53Z
dc.date.accessioned2018-11-24T10:10:11Z
dc.date.available2004-10-01T20:31:53Z
dc.date.available2018-11-24T10:10:11Z
dc.date.issued1980-08-01en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5703
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/5703
dc.description.abstractLinked list structures can be compactly represented by encoding the CDR ("next") pointer in a two-bit field and linearizing list structures as much as possible. This "CDR-coding" technique can save up to 50% on storage for linked lists. The RPLACD (alter CDR pointer) operation can be accommodated under such a scheme by using indirect pointers. Standard destructive reordering algorithms, such as REVERSE and SORT, use RPLACD quite heavily. If these algorithms are used on CDR-coded lists, the result is a proliferation of indirect pointers. We present here algorithms for destructive reversal and sorting of CDR-coded lists which avoid creation of indirect pointers. The essential idea is to note that a general list can be viewed as a linked list of array-like "chunks". The algorithm applied to such "chunky lists" is a fusion of separate array- and list-specific algorithms; intuitively, the array-specific algorithm is applied to each chunk, and the list algorithm to the list with each chunk considered as a single element.en_US
dc.format.extent15 p.en_US
dc.format.extent5323679 bytes
dc.format.extent3774242 bytes
dc.language.isoen_US
dc.titleDestructive Reordering of CDR-Coded Listsen_US


Files in this item

FilesSizeFormatView
AIM-587.pdf3.774Mbapplication/pdfView/Open
AIM-587.ps5.323Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record