Thumbnail
Access Restriction
Subscribed

Author Langston, Michael A. ♦ Huang, Bing-Chao
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract We present a novel, yet straightforward linear-time algorithm for merging two sorted lists in a fixed amount of additional space. Constant of proportionality estimates and empirical testing reveal that this procedure is reasonably competitive with merge routines free to squander unbounded additional memory, making it particularly attractive whenever space is a critical resource.
Description Affiliation: Washington State Univ., Pullman (Huang, Bing-Chao; Langston, Michael A.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 31
Issue Number 3
Page Count 5
Starting Page 348
Ending Page 352


Open content in new tab

   Open content in new tab
Source: ACM Digital Library