Thumbnail
Access Restriction
Subscribed

Author Wunderlich, Marvin C.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1967
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Many sequences are most efficiently generated on a digital computer with a sieving procedure in which one represents in the main memory of the machine a set of elements known to contain the desired sequence and then systematically sieves out elements not in the desired sequence. In this expository paper, the technical aspects of programming such sieves are discussed. Special attention is given to the most efficient methods of representing sets in the main memory of the machine as well as the programming difficulties encountered when sieving on these sets. The paper concludes with a discussion of four examples in which sieving procedures were employed.
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 1967-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 14
Issue Number 1
Page Count 10
Starting Page 10
Ending Page 19


Open content in new tab

   Open content in new tab
Source: ACM Digital Library