Thumbnail
Access Restriction
Subscribed

Author Kritzinger, P. S. ♦ Graham, J. W.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1974
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Let $\textit{r}$ be the total number of cycles required to complete a compromise merge of a given number of initial strings. Define row vectors $m\textit{r}-\textit{j}$ and $d\textit{j}$ whose components represent the number and length respectively of strings at the end of the $\textit{j}th$ cycle of the merge. It is shown in this paper that there are asymptotic approximations to these vectors, which enables one to compute their respective components directly. Consequently, the number of cycles $\textit{r}$ can be computed directly, as in the case of the balanced merge.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1974-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 21
Issue Number 1
Page Count 4
Starting Page 157
Ending Page 160


Open content in new tab

   Open content in new tab
Source: ACM Digital Library