Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/10810
Title: A Linear List Merging Algorithm
Authors: Hopcroft, John E.
Ullman, Jeffrey D.
Keywords: merging lists
list merging algorithms
algorithm
Issue Date: 14-May-2008
Abstract: A 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.
URI: http://hdl.handle.net/1813/10810
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
TR71-111.pdf468.31 kBAdobe PDFView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us