Thumbnail
Access Restriction
Subscribed

Author Gries, David ♦ Misra, Jayadev
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Algorithms ♦ Data structures ♦ Primes
Abstract A new algorithm is presented for finding all primes between 2 and n. The algorithm executes in time proportional to n (assuming that multiplication of integers not larger than n can be performed in unit time). The method has the same arithmetic complexity as the algorithm presented by Mairson [6]; however, our version is perhaps simpler and more elegant. It is also easily extended to find the prime factorization of all integers between 2 and n in time proportional to n.
Description Affiliation: Cornell Univ., Ithaca, NY (Gries, David) || Univ. of Texas at Austin, Austin (Misra, Jayadev)
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 21
Issue Number 12
Page Count 5
Starting Page 999
Ending Page 1003


Open content in new tab

   Open content in new tab
Source: ACM Digital Library