A Linear List Merging Algorithm

Thumbnail Image
Files
TR71-111.pdf (468.31 KB)
No Access Until
Permanent Link(s)
https://hdl.handle.net/1813/10810
Collections
Computer Science Technical Reports
Other Titles
Authors
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.
Journal / Series
Volume & Issue
Description
Sponsorship
Date Issued
2008-05-14T13:42:16Z
Publisher
Keywords
merging lists; list merging algorithms; algorithm
Location
Effective Date
Expiration Date
Sector
Employer
Union
Union Local
NAICS
Number of Workers
Committee Chair
Committee Co-Chair
Committee Member
Degree Discipline
Degree Name
Degree Level
Related Version
Related DOI
Related To
Related Part
Based on Related Item
Has Other Format(s)
Part of Related Item
Related To
Related Publication(s)
Link(s) to Related Publication(s)
References
Link(s) to Reference(s)
Previously Published As
Government Document
ISBN
ISMN
ISSN
Other Identifiers
Rights
Rights URI
Types
Accessibility Feature
Accessibility Hazard
Accessibility Summary
Link(s) to Catalog Record