Thumbnail
Access Restriction
Subscribed

Author Palmer, E. M. ♦ Rahimi, M. A. ♦ Robinson, R. 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 The efficiency of an information storage technique based on binary comparisons is analyzed. Generating functions are applied to finding the mean and variance of the number of comparisons needed to retrieve one item from a store of $\textit{n}$ items. Surprisingly, the variance approaches 7 - 2/3π2 for large $\textit{n}.$
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-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 21
Issue Number 3
Page Count 9
Starting Page 376
Ending Page 384


Open content in new tab

   Open content in new tab
Source: ACM Digital Library