Show simple item record

dc.contributor.authorHopcroft, John E.
dc.contributor.authorUllman, Jeffrey D.
dc.date.accessioned2008-05-14T13:42:16Z
dc.date.available2008-05-14T13:42:16Z
dc.date.issued2008-05-14T13:42:16Z
dc.identifier.urihttps://hdl.handle.net/1813/10810
dc.description.abstractA linear list merging algorithm and its analysis is presented. Starting with n lists, each containing a single element, the algorithm will execute an arbitrary sequence of requests to merge lists and to find the name of the list currently containing a given element. If the length of the sequence of requests is bounded by a constant times n, then the execution time of the algorithm on a random access computer is bounded by a constant times n.en_US
dc.subjectmerging listsen_US
dc.subjectlist merging algorithmsen_US
dc.subjectalgorithmen_US
dc.titleA Linear List Merging Algorithmen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics